Logic Programming and Nonmonotonic Reasoning: Third International Conference, Lpnmr '95 Lexington, Ky, Usa, June 26-28, 1995 : Proceedings

Complexity results for abductive logic programming.- A terminological interpretation of (abductive) logic programming.- Abduction over 3-valued extended logic programs.- On logical constraints in logic programming.- An operator for composing deductive data bases with theories of constraints.- Update rules in datalog programs.- Characterizations of the stable semantics by partial evaluation.- Game characterizations of logic program properties.- Computing the well-founded semantics faster.- Loop checking and the well-founded semantics.- Annotated revision specification programs.- Update by means of inference rules.- A sphere world semantics for default reasoning.- Revision by communication.- Hypothetical updates, priority and inconsistency in a logic programming language.- Situation calculus specifications for event calculus logic programs.- On the extension of logic programming with negation through uniform proofs.- Default consequence relations as a logical framework for logic programs.- Skeptical rational extensions.- Reasoning with stratified default theories.- Incremental methods for optimizing partial instantiation.- A transformation of propositional Prolog programs into classical logic.- Nonmonotonic inheritance, argumentation and logic programming.- An abductive framework for extended logic programming.- Embedding circumscriptive theories in general disjunctive programs.- Stable classes and operator pairs for disjunctive programs.- Nonmonotonicity and answer set inference.- Trans-epistemic semantics for logic programs.- Computing the acceptability semantics.