Modular Paracoherent Answer Sets

DOI10.1007/978-3-319-11558-0_32zbMath1432.68054OpenAlexW1029356354MaRDI QIDQ2938513

Nicola Leone, Giovanni Amendola, Thomas Eiter

Publication date: 14 January 2015

Published in: Logics in Artificial Intelligence (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-319-11558-0_32

Mathematics Subject Classification ID

Logic in artificial intelligence (68T27) Logic programming (68N17)

Related Items (2)

Paracoherent answer set computation ⋮ Semi-equilibrium models for paracoherent answer set programs

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Equilibrium logic
• Magic Sets and their application to data integration
• Paraconsistent logic programming
• A three-valued semantics for deductive databases and logic programs
• On the partial semantics for disjunctive deductive databases
• On the computational cost of disjunctive logic programming: Propositional case
• Propositional semantics for disjunctive logic programs
• Approved Models for Normal Logic Programs
• Logical Weak Completions of Paraconsistent Logics
• Modularity Aspects of Disjunctive Stable Models
• The well-founded semantics for general logic programs
• Modular Nonmonotonic Logic Programming Revisited
• Paraconsistent Stable Semantics for Extended Disjunctive Programs
• Reasoning with inconsistencies in hybrid MKNF knowledge bases
• Logic Programming and Nonmonotonic Reasoning
• Quantified Equilibrium Logic and Foundations for Answer Set Programs
• Depth-First Search and Linear Graph Algorithms

This page was built for publication: Modular Paracoherent Answer Sets