Well-Supported Semantics for Logic Programs with Generalized Rules

DOI10.1007/978-3-642-30743-0_39zbMath1357.68040MaRDI QIDQ2900549

Kewen Wang, Yi-Dong Shen, Jia-Huai You

Publication date: 23 July 2012

Published in: Correct Reasoning (Search for Journal in Brave)

Full work available at URL: http://hdl.handle.net/10072/47944

Mathematics Subject Classification ID

68Q55: Semantics in the theory of computing

68N17: Logic programming

Uses Software

• dl2asp
• Lparse

Cites Work

• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Stable models and circumscription
• Semantics and complexity of recursive aggregates in answer set programming
• Ultimate approximation and its application in nonmonotonic knowledge representation systems
• Reducts of propositional theories, satisfiability relations, and generalizations of semantics of logic programs
• A logic for default reasoning
• On the computational cost of disjunctive logic programming: Propositional case
• Nested expressions in logic programs
• Combining answer set programming with description logics for the semantic web
• Well-founded and stable semantics of logic programs with aggregates
• A Constructive semantic characterization of aggregates in answer set programming
• A Default Approach to Semantics of Logic Programs with Constraint Atoms
• Complexity Results for Nonmonotonic Logics
• The well-founded semantics for general logic programs
• Nonmonotonic reasoning is sometimes simpler!
• dl2asp: Implementing Default Logic via Answer Set Programming
• Logics in Artificial Intelligence
• Logic Programming and Nonmonotonic Reasoning
• Logic Programs with Abstract Constraints: Representaton, Disjunction and Complexities
• Logic Programming and Nonmonotonic Reasoning
• Twelve Definitions of a Stable Model
• Lparse Programs Revisited: Semantics and Representation of Aggregates