A Top-Down Query Answering Procedure for Normal Logic Programs Under the Any-World Assumption

DOI10.1007/978-3-540-75256-1_13zbMath1148.68336OpenAlexW1876907935MaRDI QIDQ3524923

Umberto Straccia

Publication date: 16 September 2008

Published in: Lecture Notes in Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-75256-1_13

Mathematics Subject Classification ID

Logic programming (68N17)

Related Items

On the existence and unicity of stable models in normal residuated logic programs ⋮ From Fuzzy to Annotated Semantic Web Languages ⋮ Fibrational Semantics for Many-Valued Logic Programs: Grounds for Non-Groundness ⋮ A top-\(k\) query answering procedure for fuzzy logic programming ⋮ DEFINITION AND ADAPTATION OF WEIGHTED FUZZY LOGIC PROGRAMS ⋮ Approximate well-founded semantics, query answering and generalized normal logic programs over lattices

Cites Work

• Semantical considerations on nonmonotonic logic
• A logic for default reasoning
• Non-monotonic logic. I
• Disjunctive stable models: Unfounded sets, fixpoint semantics, and computation
• Incremental recomputation in local languages.
• Fixpoint semantics for logic programming a survey
• Paraconsistent declarative semantics for extended logic programs
• Nonrecursive incremental evaluation of Datalog queries
• Any-world assumptions in logic programming
• Nonmonotonic Logic II
• Autoepistemic logic
• The well-founded semantics for general logic programs
• Symbolic and Quantitative Approaches to Reasoning with Uncertainty
• Epistemic foundation of stable model semantics
• Fuzzy logic programming
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item