activity
20002002
most citedPropositional satisfiability in declarative programming

2 citations · 2 across the 1 of their papers we have counts for

collaborators

6 papers

cs.LO20022 cited

Propositional satisfiability in declarative programming

Deborah East, Miroslaw Truszczynski

Answer-set programming (ASP) paradigm is a way of using logic to solve search problems. Given a search problem, to solve it one designs a theory in the logic so that models of this…

cs.AI2001

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…

cs.AI2001

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…

cs.AI2000

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…

cs.AI2000

dcs: An Implementation of DATALOG with Constraints

Deborah East, Miroslaw Truszczynski

Answer-set programming (ASP) has emerged recently as a viable programming paradigm. We describe here an ASP system, DATALOG with constraints or DC, based on non-monotonic logic. In…

cs.AI2000

On the accuracy and running time of GSAT

Deborah East, Miroslaw Truszczynski

Randomized algorithms for deciding satisfiability were shown to be effective in solving problems with thousands of variables. However, these algorithms are not complete. That is, t…