267 citations
- University of Notre DameUS9 papers
- Michigan State UniversityUS7 papers
- University of California, BerkeleyUS7 papers
- Massachusetts Institute of TechnologyUS6 papers
- California Institute of TechnologyUS5 papers
- Purdue University West LafayetteUS5 papers
- University of ZagrebHR5 papers
- Warsaw University of TechnologyPL5 papers
- Kent State UniversityUS4 papers
- University of California, Los AngelesUS4 papers
- Argonne National LaboratoryUS3 papers
- Brookhaven National LaboratoryUS3 papers
Showing cs.AIShow all
3 papers · 1 filter
cs.AI2003
On the Expressibility of Stable Logic Programming
Victor W. Marek, Jeffrey B. Remmel
(We apologize for pidgin LaTeX) Schlipf \cite{sch91} proved that Stable Logic Programming (SLP) solves all decision problems. We extend Schlipf's result to prove that…
cs.AI2003
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…
cs.AI2003
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…