Logic programs with stable model semantics as a constraint programming paradigm
Annals of Mathematics and Artificial Intelligence
Optimal binary one-error-correcting codes of length 10 have 72 codewords
IEEE Transactions on Information Theory
Towards Local Search for Answer Sets
ICLP '02 Proceedings of the 18th International Conference on Logic Programming
Representing Knowledge in A-Prolog
Computational Logic: Logic Programming and Beyond, Essays in Honour of Robert A. Kowalski, Part II
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
On the Effect of Default Negation on the Expressiveness of Disjunctive Rules
LPNMR '01 Proceedings of the 6th International Conference on Logic Programming and Nonmonotonic Reasoning
Declarative Specification and Solution of Combinatorial Auctions Using Logic Programming
LPNMR '01 Proceedings of the 6th International Conference on Logic Programming and Nonmonotonic Reasoning
Diagnosing Physical Systems in A-Prolog
LPNMR '01 Proceedings of the 6th International Conference on Logic Programming and Nonmonotonic Reasoning
Stable Model Semantics of Weight Constraint Rules
LPNMR '99 Proceedings of the 5th 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
Computing Equilibrium Models Using Signed Formulas
CL '00 Proceedings of the First International Conference on Computational Logic
An AIG-Based QBF-solver using SAT for preprocessing
Proceedings of the 47th Design Automation Conference
Relating constraint answer set programming languages and algorithms
Artificial Intelligence
| Hi-index | 0.00 |
The rules associated with propositional logic programs and the stable model semantics are not expressive enough to let one write concise programs. This problem is alleviated by introducing some new types of propositional rules. Together with a decision procedure that has been used as a base for an effcient implementation, the new rules supplant the standard ones in practical applications of the stable model semantics.