1.6k citations
- Massachusetts Institute of TechnologyUS20 papers
- University of California, BerkeleyUS20 papers
- Michigan State UniversityUS18 papers
- University of ZagrebHR16 papers
- Argonne National LaboratoryUS15 papers
- Kent State UniversityUS15 papers
- Pennsylvania State UniversityUS15 papers
- Purdue University West LafayetteUS15 papers
- Texas A&M UniversityUS15 papers
- The Ohio State UniversityUS15 papers
- University of California, Los AngelesUS15 papers
- University of WashingtonUS15 papers
Showing cs.LOShow all
3 papers · 1 filter
cs.LO2005
Computing minimal models, stable models and answer sets
Z. Lonc, M. Truszczynski
We propose and study algorithms to compute minimal models, stable models and answer sets of t-CNF theories, and normal and disjunctive t-programs. We are especially interested in a…
cs.LO2003
Logic programs with monotone cardinality atoms
Victor W. Marek, Ilkka Niemela, Miroslaw Truszczynski
We investigate mca-programs, that is, logic programs with clauses built of monotone cardinality atoms of the form kX, where k is a non-negative integer and X is a finite set of pro…
cs.LO2002
Computing stable models: worst-case performance estimates
Zbigniew Lonc, Miroslaw Truszczynski
We study algorithms for computing stable models of propositional logic programs and derive estimates on their worst-case performance that are asymptotically better than the trivial…