
Automated Aggregator – Rewriting with the Counting Aggregate
Answer set programming is a leading declarative constraint programming p...
read it

Encoding Selection for Solving Hamiltonian Cycle Problems with ASP
It is common for search and optimization problems to have alternative eq...
read it

Maximin share allocations on cycles
The problem of fair division of indivisible goods is a fundamental probl...
read it

The informal semantics of Answer Set Programming: A Tarskian perspective
In Knowledge Representation, it is crucial that knowledge engineers have...
read it

New Models for Generating Hard Random Boolean Formulas and Disjunctive Logic Programs
We propose two models of random quantified boolean formulas and their na...
read it

Abstract Modular Systems and Solvers
Integrating diverse formalisms into modular knowledge representation sys...
read it

The ViewUpdate Problem for Indefinite Databases
This paper introduces and studies a declarative framework for updating v...
read it

Strong Equivalence of Qualitative Optimization Problems
We introduce the framework of qualitative optimization problems (or, sim...
read it

Origins of AnswerSet Programming  Some Background And Two Personal Accounts
We discuss the evolution of aspects of nonmonotonic reasoning towards th...
read it

Revisiting Epistemic Specifications
In 1991, Michael Gelfond introduced the language of epistemic specificat...
read it

Reiter's Default Logic Is a Logic of Autoepistemic Reasoning And a Good One, Too
A fact apparently not observed earlier in the literature of nonmonotonic...
read it

Transition Systems for Model Generators  A Unifying Approach
A fundamental task for propositional logic is to compute models of propo...
read it

Relativized hyperequivalence of logic programs for modular programming
A recent framework of relativized hyperequivalence of programs offers a ...
read it

Propositional satisfiability in declarative programming
Answerset programming (ASP) paradigm is a way of using logic to solve s...
read it

Ultimate approximations in nonmonotonic knowledge representation systems
We study fixpoints of operators on lattices. To this end we introduce th...
read it

Computing stable models: worstcase performance estimates
We study algorithms for computing stable models of propositional logic p...
read it

DATALOG with constraints  an answerset programming system
Answerset programming (ASP) has emerged recently as a viable programmin...
read it

Proceedings of the 8th International Workshop on NonMonotonic Reasoning, NMR'2000
The papers gathered in this collection were presented at the 8th Interna...
read it

dcs: An Implementation of DATALOG with Constraints
Answerset programming (ASP) has emerged recently as a viable programmin...
read it

On the accuracy and running time of GSAT
Randomized algorithms for deciding satisfiability were shown to be effec...
read it

Uniform semantic treatment of default and autoepistemic logics
We revisit the issue of connections between two leading formalisms in no...
read it

Computing large and small stable models
In this paper, we focus on the problem of existence and computing of sma...
read it

Representation Theory for Default Logic
Default logic can be regarded as a mechanism to represent families of be...
read it

Extremal problems in logic programming and stable model computation
We study the following problem: given a class of logic programs C, deter...
read it

Stable models and an alternative logic programming paradigm
In this paper we reexamine the place and role of stable model semantics ...
read it