2 citations · 2 across the 5 of their papers we have counts for
8 papers · 1 filter
WSAT(cc) - a fast local-search ASP solver
Lengning Liu, Miroslaw Truszczynski
We describe WSAT(cc), a local-search solver for computing models of theories in the language of propositional logic extended by cardinality atoms. WSAT(cc) is a processing back-end…
Local-search techniques for propositional logic extended with cardinality constraints
Lengning Liu, Miroslaw Truszczynski
We study local-search satisfiability solvers for propositional logic extended with cardinality atoms, that is, expressions that provide explicit ways to model constraints on cardin…
aspps --- an implementation of answer-set programming with propositional schemata
Deborah East. Miroslaw Truszczynski
We present an implementation of an answer-set programming paradigm, called aspps (short for answer-set programming with propositional schemata). The system aspps is designed to pro…
Propositional satisfiability in answer-set programming
Deborah East, Miroslaw Truszczynski
We show that propositional logic and its extensions can support answer-set programming in the same way stable logic programming and disjunctive logic programming do. To this end, w…
DATALOG with constraints - an answer-set programming system
Deborah East, Miroslaw Truszczynski
Answer-set programming (ASP) has emerged recently as a viable programming paradigm well attuned to search problems in AI, constraint satisfaction and combinatorics. Propositional l…
Proceedings of the 8th International Workshop on Non-Monotonic Reasoning, NMR'2000
Chitta Baral, Miroslaw Truszczynski
The papers gathered in this collection were presented at the 8th International Workshop on Nonmonotonic Reasoning, NMR2000. The series was started by John McCarthy in 1978. The fir…