activity
20052023
most citedOn Equivalence of Infinitary Formulas under the Stable Model Semantics

11 citations · 21 across the 5 of their papers we have counts for

collaborators

5 papers

cs.AI2023★ 6 cited

Current and Future Challenges in Knowledge Representation and Reasoning

James P. Delgrande, Birte Glimm, Thomas Meyer +2

Knowledge Representation and Reasoning is a central, longstanding, and active area of Artificial Intelligence. Over the years it has evolved significantly; more recently it has bee…

cs.LO2014★ 11 cited

On Equivalence of Infinitary Formulas under the Stable Model Semantics

Amelia Harrison, Vladimir Lifschitz, Miroslaw Truszczynski

Propositional formulas that are equivalent in intuitionistic logic, or in its extension known as the logic of here-and-there, have the same stable models. We extend this theorem to…

cs.DB2010★ 1 cited

Active Integrity Constraints and Revision Programming

L. Caroprese, M. Truszczynski

We study active integrity constraints and revision programming, two formalisms designed to describe integrity constraints on databases and to specify policies on preferred ways to…

cs.AI2009★ 3 cited

Relativized hyperequivalence of logic programs for modular programming

Miroslaw Truszczyński, Stefan Woltran

A recent framework of relativized hyperequivalence of programs offers a unifying generalization of strong and uniform equivalence. It seems to be especially well suited for applica…

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…