Well-supported semantics for logic programs with generalized rules
From MaRDI portal
Publication:2900549
DOI10.1007/978-3-642-30743-0_39zbMATH Open1357.68040OpenAlexW30003877MaRDI QIDQ2900549FDOQ2900549
Authors: Jia-Huai You, Yi-Dong Shen, Kewen Wang 
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
Recommendations
- Supportedly stable answer sets for logic programs with generalized atoms
- Generalized well-founded semantics for logic programs
- The well-founded semantics for general logic programs
- Well-founded and stable semantics of logic programs with aggregates
- Chain answer sets for logic programs with generalized atoms
Cites Work
- \textsf{dl2asp}: implementing default logic via answer set programming
- Lparse Programs Revisited: Semantics and Representation of Aggregates
- 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
- Title not available (Why is that?)
- The well-founded semantics for general logic programs
- Semantics and complexity of recursive aggregates in answer set programming
- Logic Programming and Nonmonotonic Reasoning
- Title not available (Why is that?)
- Well-founded and stable semantics of logic programs with aggregates
- Answer sets for logic programs with arbitrary abstract constraint atoms
- Stable models and circumscription
- Reducts of propositional theories, satisfiability relations, and generalizations of semantics of logic programs
- A logic for default reasoning
- Ultimate approximation and its application in nonmonotonic knowledge representation systems
- A Constructive semantic characterization of aggregates in answer set programming
- Logics in Artificial Intelligence
- Complexity Results for Nonmonotonic Logics
- Logic Programming and Nonmonotonic Reasoning
- Twelve Definitions of a Stable Model
- Title not available (Why is that?)
- Logic Programs with Abstract Constraints: Representaton, Disjunction and Complexities
- A Default Approach to Semantics of Logic Programs with Constraint Atoms
- Nonmonotonic reasoning is sometimes simpler!
Cited In (11)
- Argumentation-based semantics for logic programs with first-order formulae
- Stability, supportedness, minimality and Kleene answer set programs
- Approximate well-founded semantics, query answering and generalized normal logic programs over lattices
- Iteratively-supported formulas and strongly supported models for Kleene answer set programs (extended abstract)
- Expressiveness of logic programs under the general stable model semantics
- Title not available (Why is that?)
- FLP answer set semantics without circular justifications for general logic programs
- Generalized well-founded semantics for logic programs
- Chain answer sets for logic programs with generalized atoms
- Polynomial approximation to well-founded semantics for logic programs with generalized atoms: case studies
- Supportedly stable answer sets for logic programs with generalized atoms
Uses Software
This page was built for publication: Well-supported semantics for logic programs with generalized rules
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2900549)
