Back to search

University of Patras

ΠΟΛΥΠΛΟΚΟΤΗΤΑ ΚΑΙ ΕΥΡΕΤΙΚΕΣ ΜΕΘΟΔΟΙ ΓΙΑ ΤΗΝ ΠΙΘΑΝΟΤΙΚΗ ΛΟΓΙΚΗ

Abstract

dc:description

THE DESIGN OF EXPERT SYSTEMS POSES A PROBLEM KNOWN AS "APPROXIMATE REASONING". IN THIS PROBLEM WE ARE ASKED TO DETERMINE THE BELIEF TO ANOTHER STATEMENT. BASED ON THE THEORY OF "PROBABILISTIC LOGIC", WE MODEL UNCERTAINTY AS PROBABILITY OF STATEMENTS. A SET OF STATEMENTS CAN BE MODELLED AS A LINEAR PROGRAM, WHILE THE BASIC PROBLEM IS PROVED POLYNOMIALLY EQUIVALENT TO "PROBABILISTIC SATISFIABILITY". WE NEXT SHOW THAT EVEN THE SIMPLEST FORMS OF "PROBABILISTIC LOGIC" ARE COMPUTATIONALLY INTRACTABLE (NP-COMPLETE) AND WE PROPOSE VARIOUS HEURISTICS BASEDON THE SIMPLEX METHOD FOR THE PRACTICAL SOLUTION OF THE PROBLEM.

Degree

thesis:*
Grantor dc:publisher
University of Patras
Year dc:date
1988

Author and committee

dc:creator, dc:contributor.*
Authors dc:creator
  • Καββαδίας, Δημήτρης
  • Kavvadias, Dimitris

Subjects

dc:subject × 24

Rights

Language dc:language
gre

Identifiers

dc:identifier.*
Identifier
10.12681/eadd/0988

Chain of custody

source
Harvested from
Greek National Archive of PhD Theses
Base URL
phdtheses.ekt.gr/eadd_oai/request
Last updated
2026-11-18
Source record
OAI-PMH GetRecord
citation

Καββαδίας, Δημήτρης; Kavvadias, Dimitris. ΠΟΛΥΠΛΟΚΟΤΗΤΑ ΚΑΙ ΕΥΡΕΤΙΚΕΣ ΜΕΘΟΔΟΙ ΓΙΑ ΤΗΝ ΠΙΘΑΝΟΤΙΚΗ ΛΟΓΙΚΗ. University of Patras, 1988. http://hdl.handle.net/10442/hedi/0988