Logic programming and reasoning with incomplete information

DOI10.1007/BF01530762zbMath0858.68013MaRDI QIDQ1924820

Michael Gelfond

Publication date: 31 March 1997

Published in: Annals of Mathematics and Artificial Intelligence (Search for Journal in Brave)

Mathematics Subject Classification ID

Logic programming (68N17)

Related Items

Evaluating epistemic negation in answer set programming, Querying incomplete information in RDF with SPARQL, Logic Programming with Graded Modality, Equilibrium logic, Autoepistemic logic of knowledge and beliefs, Nonmonotonicity and answer set inference, Trans-epistemic semantics for logic programs, Thirty years of Epistemic Specifications, On Uniform Equivalence of Epistemic Logic Programs, Epistemic logic programs: a study of some properties, Reasoning about actions with loops via Hoare logic, Unnamed Item, eclingo : A Solver for Epistemic Logic Programs, General default logic, selp: A Single-Shot Epistemic Logic Program Solver, Autoepistemic answer set programming, Autoepistemic equilibrium logic and epistemic specifications, A parallel memory-efficient epistemic logic program solver: harder, better, faster, Strong and explicit negation in non-monotonic reasoning and logic programming

Cites Work

• Semantical considerations on nonmonotonic logic
• Negation as failure: careful closure procedure
• Inferring negative information from disjunctive databases
• A logic for default reasoning
• Circumscription - a form of non-monotonic reasoning
• Non-monotonic logic. I
• Deduction in non-Horn databases
• All I know: A study in autoepistemic logic
• Making prolog more expressive
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item