Well-supported semantics for logic programs with generalized rules
From MaRDI portal
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
- scientific article; zbMATH DE number 25190 (Why is no real title available?)
- scientific article; zbMATH DE number 67492 (Why is no real title available?)
- scientific article; zbMATH DE number 1936671 (Why is no real title available?)
- A Constructive semantic characterization of aggregates in answer set programming
- A Default Approach to Semantics of Logic Programs with Constraint Atoms
- A logic for default reasoning
- Answer sets for logic programs with arbitrary abstract constraint atoms
- Combining answer set programming with description logics for the semantic web
- Complexity Results for Nonmonotonic Logics
- Logic Programming and Nonmonotonic Reasoning
- Logic Programming and Nonmonotonic Reasoning
- Logic Programs with Abstract Constraints: Representaton, Disjunction and Complexities
- Logics in Artificial Intelligence
- Lparse Programs Revisited: Semantics and Representation of Aggregates
- Nested expressions in logic programs
- Nonmonotonic reasoning is sometimes simpler!
- On the computational cost of disjunctive logic programming: Propositional case
- Reducts of propositional theories, satisfiability relations, and generalizations of semantics of logic programs
- Semantics and complexity of recursive aggregates in answer set programming
- Stable models and circumscription
- The well-founded semantics for general logic programs
- Twelve Definitions of a Stable Model
- Ultimate approximation and its application in nonmonotonic knowledge representation systems
- Well-founded and stable semantics of logic programs with aggregates
- \textsf{dl2asp}: implementing default logic via answer set programming
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
- scientific article; zbMATH DE number 2084772 (Why is no real title available?)
- 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
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)
