Strongly equivalent logic programs
ACM Transactions on Computational Logic (TOCL) - Special issue devoted to Robert A. Kowalski
Logic programming and knowledge representation-the A-prolog perspective
Artificial Intelligence
Extending and implementing the stable model semantics
Artificial Intelligence
Knowledge Representation, Reasoning, and Declarative Problem Solving
Knowledge Representation, Reasoning, and Declarative Problem Solving
Ultimate Well-Founded and Stable Semantics for Logic Programs with Aggregates
Proceedings of the 17th International Conference on Logic Programming
ASSAT: computing answer sets of a logic program by SAT solvers
Eighteenth national conference on Artificial intelligence
Theory and Practice of Logic Programming
Strong equivalence made easy: nested expressions and weight constraints
Theory and Practice of Logic Programming
Logic programs with abstract constraint atoms
AAAI'04 Proceedings of the 19th national conference on Artifical intelligence
IJCAI'03 Proceedings of the 18th international joint conference on Artificial intelligence
Logic programs with monotone abstract constraint atoms*
Theory and Practice of Logic Programming
Complexity results for answer set programming with bounded predicate arities and implications
Annals of Mathematics and Artificial Intelligence
Qualitative Constraint Enforcement in Advanced Policy Specification
ECSQARU '07 Proceedings of the 9th European Conference on Symbolic and Quantitative Approaches to Reasoning with Uncertainty
On the Continuity of Gelfond-Lifschitz Operator and Other Applications of Proof-Theory in ASP
ICLP '08 Proceedings of the 24th International Conference on Logic Programming
Design and implementation of aggregate functions in the dlv system*
Theory and Practice of Logic Programming
Answer sets for logic programs with arbitrary abstract constraint atoms
AAAI'06 Proceedings of the 21st national conference on Artificial intelligence - Volume 1
A generalized gelfond-lifschitz transformation for logic programs with abstract constraints
AAAI'07 Proceedings of the 22nd national conference on Artificial intelligence - Volume 1
Properties and applications of programs with monotone and convex constraints
Journal of Artificial Intelligence Research
Answer sets for logic programs with arbitrary abstract constraint atoms
Journal of Artificial Intelligence Research
Characterising equilibrium logic and nested logic programs: Reductions and complexity1,2
Theory and Practice of Logic Programming
Characterizations of stable model semantics for logic programs with arbitrary constraint atoms
Theory and Practice of Logic Programming
Logic programs with abstract constraint atoms: The role of computations
Artificial Intelligence
Logic programs with abstract constraints: representaton, disjunction and complexities
LPNMR'07 Proceedings of the 9th international conference on Logic programming and nonmonotonic reasoning
Logic programming for knowledge representation
ICLP'07 Proceedings of the 23rd international conference on Logic programming
Generic tableaux for answer set programming
ICLP'07 Proceedings of the 23rd international conference on Logic programming
Logic programs with abstract constraint atoms: the role of computations
ICLP'07 Proceedings of the 23rd international conference on Logic programming
Pbmodels: software to compute stable models by pseudoboolean solvers
LPNMR'05 Proceedings of the 8th international conference on Logic Programming and Nonmonotonic Reasoning
| Hi-index | 0.00 |
We study properties of programs with monotone and convex constraints. We extend to these formalisms concepts and results from normal logic programming. They include tight programs and Fages Lemma, program completion and loop formulas, and the notions of strong and uniform equivalence with their characterizations. Our results form an abstract account of properties of some recent extensions of logic programming with aggregates, especially the formalism of smodels.