Characterizations of stable model semantics for logic programs with arbitrary constraint atoms
From MaRDI portal
Recommendations
- Logic programs with stable model semantics as a constraint programming paradigm
- A note on the stable model semantics for logic programs
- Expressiveness of logic programs under the general stable model semantics
- scientific article; zbMATH DE number 1368933
- The Stable Models of a Predicate Logic Program
- Contributions to the stable model semantics of logic programs with negation
- On stable-like semantics for logic programs
- scientific article; zbMATH DE number 1114052
- Stable models and their computation for logic programming with inheritance and true negation
- On the existence of stable models of non-stratified logic programs
Cites work
- A Constructive semantic characterization of aggregates in answer set programming
- A three-valued semantics for deductive databases and logic programs
- Answer set programming and plan generation
- Building tractable disjunctive constraints
- Completed logic programs and their consistency
- Extending and implementing the stable model semantics
- Knowledge Representation, Reasoning and Declarative Problem Solving
- Logic programming and knowledge representation---The A-Prolog perspective
- Logic programs with monotone abstract constraint atoms
- Logic programs with stable model semantics as a constraint programming paradigm
- Well-founded and stable semantics of logic programs with aggregates
Cited in
(19)- A note on the stable model semantics for logic programs
- Logic programs with stable model semantics as a constraint programming paradigm
- Vicious circle principle, aggregates, and formation of sets in ASP based languages
- Relating weight constraint and aggregate programs: semantics and representation
- Concrete results on abstract rules
- Sampler programs: the stable model semantics of abstract constraint programs revisited
- On the existence of stable models of non-stratified logic programs
- Logic Programs with Abstract Constraint Atoms: The Role of Computations
- Answer sets for logic programs with arbitrary abstract constraint atoms
- A Default Approach to Semantics of Logic Programs with Constraint Atoms
- scientific article; zbMATH DE number 140407 (Why is no real title available?)
- scientific article; zbMATH DE number 2084772 (Why is no real title available?)
- On logical constraints in logic programming
- Logic Programs with Abstract Constraints: Representaton, Disjunction and Complexities
- Logic programs with monotone abstract constraint atoms
- On the Continuity of Gelfond-Lifschitz Operator and Other Applications of Proof-Theory in ASP
- Contributions to the stable model semantics of logic programs with negation
- The loop formula based semantics of description logic programs
- Logic programs with abstract constraint atoms: the role of computations
This page was built for publication: Characterizations of stable model semantics for logic programs with arbitrary constraint atoms
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3183130)