System Description: DLV with Aggregates

Dell'Armi, Tina; Faber, Wolfgang; Ielpa, Giuseppe; Leone, Nicola; Perri, Simona; Pfeifer, Gerald

doi:10.1007/978-3-540-24609-1_28

Search citation statements

Order By: Relevance

Paper Sections

Select...

Introduction2

Citation Types

Supporting

Mentioning

Contrasting

Year Published

2005

Publication Types

Select...

Book1

Relationship

Self Cite0

Independent1

Authors

Journals

Cited by 1 publication

(2 citation statements)

References 4 publications

Supporting

Mentioning

Contrasting

Order By: Relevance

“…PC(ID) is a major enhancement of the expressivity [19]. Solvers for SAT(PC(ID)) are also strongly related to ASP solvers such as Smodels [21] and DLV [4]. These solvers use the fixpoint operator of the well-founded semantics as a boolean propagation mechanism for rule sets.…”

Section: Introductionmentioning

confidence: 99%

See 1 more Smart Citation

Satisfiability Checking for PC(ID)

Mariën

Mitra

Denecker

et al. 2005

Logic for Programming, Artificial Intelligence, and Reasoning

View full text Add to dashboard Cite

The logic FO(ID) extends classical first order logic with inductive definitions. This paper studies the satisifiability problem for PC(ID), its propositional fragment. We develop a framework for model generation in this logic, present an algorithm and prove its correctness. As FO(ID) is an integration of classical logic and logic programming, our algorithm integrates techniques from SAT and ASP. We report on a prototype system, called MidL, experimentally validating our approach.

show abstract

Section: Introductionmentioning

confidence: 99%

“…Despite the semantical differences, the computational tasks of our algorithm are very similar to those of algorithms like Smodels' Expand [21] and DLV's DetCons [4]. Its novelty lies in the use of justification semantics [9], which offers a different view on the computational task involved:…”

Section: Introductionmentioning

confidence: 99%