Sciweavers

Free Online Productivity Tools i2Speak i2Symbol i2OCR iTex2Img iWeb2Print iWeb2Shot i2Type iPdf2Split iPdf2Merge i2Bopomofo i2Arabic i2Style i2Image i2PDF iLatex2Rtf Sci2ools

13

AAAI
1994

favoriteEmaildiscussreport

106views Intelligent Agents» more AAAI 1994»

Soundness and Completeness of a Logic Programming Approach to Default Logic

13 years 5 months ago

Soundness and Completeness of a Logic Programming Approach to Default Logic

Download www.aaai.org

We present a method of representing some classes of default theories as normal logic programs. The main point is that the standard semantics (i.e. SLDNF-resolution) computes answer substitutions that correspond exactly to the extensions of the represented default theory. We explain the steps of constructing a logic program LogProg(P,D) from a given default theory (P,D), and present the proof ideas of the soundness and completeness results for the approach.

Grigoris Antoniou, Elmar Langetepe

Real-time Traffic

AAAI 1994 | Computes Answer Substitutions | Default Theory | Intelligent Agents | Logic Program |

claim paper

Related Content

» Logic Programming with General Clauses and Defaults Based on Model Elimination

» Strong and uniform equivalence of nonmonotonic theories an algebraic approach

» A Comparison of Sceptical NAFFree Logic Programming Approaches

» Sound and Complete Inference Rules for SEConsequence

» A General Framework for Sound and Complete FloydHoare Logics

» Verifying Dribble Agents

» Towards an Axiom System for Default Logic

» Automated Reasoning with a ConstraintBased Metainterpreter

» Prioritizing Default Logic

Post Info
More Details (n/a)

Added	02 Nov 2010
Updated	02 Nov 2010
Type	Conference
Year	1994
Where	AAAI
Authors	Grigoris Antoniou, Elmar Langetepe

Comments (0)