Abstract
dc:descriptionTHE 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- Αλγόριθμοι
- Γραμμικός προγραμματισμός
- Ευρετικές μέθοδοι
- ΝΡ-πληρότητα
- ΠΙΘΑΝΟΤΙΚΗ ΛΟΓΙΚΗ
- Πολυπλοκότητα
- ΣΥΣΤΗΜΑΤΑ ΕΜΠΕΙΡΟΓΝΩΜΟΝΕΣ
- Τεχνητή νοημοσύνη
- Algorithms
- Artificial intelligence
- Complexity
- Expert systems
- Heuristics
- Linear programming
- NP - completeness
- PROBABILISTIC LOGIC
- Φυσικές Επιστήμες
- Επιστήμη Ηλεκτρονικών Υπολογιστών και Πληροφορική
- Επιστήμες Μηχανικού και Τεχνολογία
- Επιστήμη Ηλεκτρολόγου Μηχανικού, Ηλεκτρονικού Μηχανικού, Μηχανικού Η/Υ
- Natural Sciences
- Computer and Information Sciences
- Engineering and Technology
- Electrical Engineering, Electronic Engineering, Information Engineering
Rights
- Language dc:language
- gre
Identifiers
dc:identifier.*- Identifier
- 10.12681/eadd/0988