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

DOI10.1007/978-3-540-75256-1_13zbMATH Open1148.68336OpenAlexW1876907935MaRDI QIDQ3524923FDOQ3524923

Authors: 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

Recommendations

• Any-world assumptions in logic programming
• Symbolic and Quantitative Approaches to Reasoning with Uncertainty
• Approximate well-founded semantics, query answering and generalized normal logic programs over lattices
• A top-\(k\) query answering procedure for fuzzy logic programming
• scientific article; zbMATH DE number 4166941

Mathematics Subject Classification ID

Logic programming (68N17)

Cites Work

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

Cited In (8)

• On the existence and unicity of stable models in normal residuated logic programs
• A top-\(k\) query answering procedure for fuzzy logic programming
• Approximate well-founded semantics, query answering and generalized normal logic programs over lattices
• Symbolic and Quantitative Approaches to Reasoning with Uncertainty
• Any-world assumptions in logic programming
• From fuzzy to annotated semantic web languages
• DEFINITION AND ADAPTATION OF WEIGHTED FUZZY LOGIC PROGRAMS
• Fibrational Semantics for Many-Valued Logic Programs: Grounds for Non-Groundness

This page was built for publication: A Top-Down Query Answering Procedure for Normal Logic Programs Under the Any-World Assumption

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3524923)