activity
19982003
most citedUltimate approximations in nonmonotonic knowledge representation systems

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

collaborators

7 papers

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.AI200216 cited

Ultimate approximations in nonmonotonic knowledge representation systems

Marc Denecker, Victor W. Marek, Miroslaw Truszczynski

We study fixpoints of operators on lattices. To this end we introduce the notion of an approximation of an operator. We order approximations by means of a precision ordering. We sh…

cs.AI2001

Annotated revision programs

Victor Marek, Inna Pivkina, Miroslaw Truszczynski

Revision programming is a formalism to describe and enforce updates of belief sets and databases. That formalism was extended by Fitting who assigned annotations to revision atoms.…

cs.AI2000

Uniform semantic treatment of default and autoepistemic logics

Marc Denecker, Victor W. Marek, Miroslaw Truszczynski

We revisit the issue of connections between two leading formalisms in nonmonotonic reasoning: autoepistemic logic and default logic. For each logic we develop a comprehensive seman…

cs.LO1999

Representation Theory for Default Logic

Victor Marek, Jan Treur, Miroslaw Truszczynski

Default logic can be regarded as a mechanism to represent families of belief sets of a reasoning agent. As such, it is inherently second-order. In this paper, we study the problem…

cs.LO1999

Fixpoint 3-valued semantics for autoepistemic logic

M. Denecker, V. Marek, M. Truszczynski

The paper presents a constructive fixpoint semantics for autoepistemic logic (AEL). This fixpoint characterizes a unique but possibly three-valued belief set of an autoepistemic th…