Journal of the ACM (JACM)
Stable semantics for probabilistic deductive databases
Information and Computation
Logic programs with stable model semantics as a constraint programming paradigm
Annals of Mathematics and Artificial Intelligence
IEEE Transactions on Knowledge and Data Engineering
Dynamic Programming in Datalog with Aggregates
IEEE Transactions on Knowledge and Data Engineering
Product Configuration Frameworks-A Survey
IEEE Intelligent Systems
Developing a Declarative Rule Language for Applications in Product Configuration
PADL '99 Proceedings of the First International Workshop on Practical Aspects of Declarative Languages
NP-SPEC: An Executable Specification Language for Solving All Problems in NP
PADL '99 Proceedings of the First International Workshop on Practical Aspects of Declarative Languages
Extending the Stable Model Semantics with More Expressive Rules
LPNMR '99 Proceedings of the 5th International Conference on Logic Programming and Nonmonotonic Reasoning
Smodels - An Implementation of the Stable Model and Well-Founded Semantics for Normal LP
LPNMR '97 Proceedings of the 4th International Conference on Logic Programming and Nonmonotonic Reasoning
Strong and Weak Constraints in Disjunctive Datalog
LPNMR '97 Proceedings of the 4th International Conference on Logic Programming and Nonmonotonic Reasoning
Ultimate Well-Founded and Stable Semantics for Logic Programs with Aggregates
Proceedings of the 17th International Conference on Logic Programming
Testing the Equivalence of Logic Programs under Stable Model Semantics
JELIA '02 Proceedings of the European Conference on Logics in Artificial Intelligence
NoMoRe: Non-monotonic Reasoning with Logic Programs
JELIA '02 Proceedings of the European Conference on Logics in Artificial Intelligence
LPNMR '01 Proceedings of the 6th International Conference on Logic Programming and Nonmonotonic Reasoning
Including Diagnostic Information in Configuration Models
CL '00 Proceedings of the First International Conference on Computational Logic
Issues in parallel execution of non-monotonic reasoning systems
Parallel Computing
Quo Vadis Answer Set Programming?
ICLP '08 Proceedings of the 24th International Conference on Logic Programming
Answer Set Programming without Unstratified Negation
ICLP '08 Proceedings of the 24th International Conference on Logic Programming
Answer Set Programming for Single-Player Games in General Game Playing
ICLP '09 Proceedings of the 25th International Conference on Logic Programming
Computing Weighted Solutions in Answer Set Programming
LPNMR '09 Proceedings of the 10th International Conference on Logic Programming and Nonmonotonic Reasoning
Level Mapping Induced Loop Formulas for Weight Constraint and Aggregate Logic Programs
Fundamenta Informaticae
Semantics and complexity of recursive aggregates in answer set programming
Artificial Intelligence
Planning for multiagent using ASP-prolog
CLIMA'09 Proceedings of the 10th international conference on Computational logic in multi-agent systems
Level Mapping Induced Loop Formulas for Weight Constraint and Aggregate Logic Programs
Fundamenta Informaticae
Automatic music composition using answer set programming
Theory and Practice of Logic Programming
Computing weighted solutions in ASP: representation-based method vs. search-based method
Annals of Mathematics and Artificial Intelligence
Implementation and experimentation of the logic language NP Datalog
DEXA'06 Proceedings of the 17th international conference on Database and Expert Systems Applications
Reasoning and planning with cooperative actions for multiagents using answer set programming
DALT'09 Proceedings of the 7th international conference on Declarative Agent Languages and Technologies
Automated verification of state sequence invariants in general game playing
Artificial Intelligence
Strong equivalence of RASP programs
Correct Reasoning
Disjunctive programs with set constraints
Correct Reasoning
Annotating answer-set programs in lana*
Theory and Practice of Logic Programming
Nested Weight Constraints in ASP
Fundamenta Informaticae - Special Issue on the Italian Conference on Computational Logic: CILC 2011
| Hi-index | 0.00 |
A generalization of logic program rules is proposed where rules are built from weight constraints with type information for each predicate instead of simple literals. These kinds of constraints are useful for concisely representing different kinds of choices as well as cardinality, cost and resource constraints in combinatorial problems such as product configuration. A declarative semantics for the rules is presented which generalizes the stable model semantics of normal logic programs. It is shown that for ground rules the complexity of the relevant decision problems stays in NP. The first implementation of the language handles a decidable subset where function symbols are not allowed. It is based on a new procedure for computing stable models for ground rules extending normal programs with choice and weight constructs and a compilation technique where a weight rule with variables is transformed to a set of such simpler ground rules.