Characterizations of stable model semantics for logic programs with arbitrary constraint atoms
From MaRDI portal
Publication:3183130
DOI10.1017/S1471068409990056zbMath1177.68042OpenAlexW2120811814MaRDI QIDQ3183130
Jia-Huai You, Yi-Dong Shen, Li Yan Yuan
Publication date: 19 October 2009
Published in: Theory and Practice of Logic Programming (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1017/s1471068409990056
stable model semanticsGelfond-Lifschitz transformationabstract constraint atomsanswer set programing
Related Items
The loop formula based semantics of description logic programs, Vicious circle principle, aggregates, and formation of sets in ASP based languages, Relating weight constraint and aggregate programs: Semantics and representation
Cites Work
- A three-valued semantics for deductive databases and logic programs
- Logic programming and knowledge representation---The A-Prolog perspective
- Answer set programming and plan generation
- Extending and implementing the stable model semantics
- Logic programs with stable model semantics as a constraint programming paradigm
- Building tractable disjunctive constraints
- Completed logic programs and their consistency
- Well-founded and stable semantics of logic programs with aggregates
- A Constructive semantic characterization of aggregates in answer set programming
- Knowledge Representation, Reasoning and Declarative Problem Solving
- Logic programs with monotone abstract constraint atoms