research
∙
08/08/2023
Current and Future Challenges in Knowledge Representation and Reasoning
Knowledge Representation and Reasoning is a central, longstanding, and a...
share
research
∙
09/22/2020
Automated Aggregator – Rewriting with the Counting Aggregate
Answer set programming is a leading declarative constraint programming p...
research
∙
09/18/2019
Encoding Selection for Solving Hamiltonian Cycle Problems with ASP
It is common for search and optimization problems to have alternative eq...
research
∙
04/25/2019
Maximin share allocations on cycles
The problem of fair division of indivisible goods is a fundamental probl...
research
∙
01/26/2019
The informal semantics of Answer Set Programming: A Tarskian perspective
In Knowledge Representation, it is crucial that knowledge engineers have...
research
∙
02/11/2018
New Models for Generating Hard Random Boolean Formulas and Disjunctive Logic Programs
We propose two models of random quantified boolean formulas and their na...
research
∙
12/20/2013
Abstract Modular Systems and Solvers
Integrating diverse formalisms into modular knowledge representation sys...
research
∙
05/21/2012
The View-Update Problem for Indefinite Databases
This paper introduces and studies a declarative framework for updating v...
research
∙
12/04/2011
Strong Equivalence of Qualitative Optimization Problems
We introduce the framework of qualitative optimization problems (or, sim...
research
∙
08/16/2011
Origins of Answer-Set Programming - Some Background And Two Personal Accounts
We discuss the evolution of aspects of nonmonotonic reasoning towards th...
research
∙
08/16/2011
Revisiting Epistemic Specifications
In 1991, Michael Gelfond introduced the language of epistemic specificat...
research
∙
08/16/2011
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...
research
∙
05/03/2011
Transition Systems for Model Generators - A Unifying Approach
A fundamental task for propositional logic is to compute models of propo...
research
∙
07/23/2009
Relativized hyperequivalence of logic programs for modular programming
A recent framework of relativized hyperequivalence of programs offers a ...
research
∙
11/25/2002
Propositional satisfiability in declarative programming
Answer-set programming (ASP) paradigm is a way of using logic to solve s...
research
∙
05/11/2002
Ultimate approximations in nonmonotonic knowledge representation systems
We study fixpoints of operators on lattices. To this end we introduce th...
research
∙
05/11/2002
Computing stable models: worst-case performance estimates
We study algorithms for computing stable models of propositional logic p...
research
∙
03/24/2000
DATALOG with constraints - an answer-set programming system
Answer-set programming (ASP) has emerged recently as a viable programmin...
research
∙
03/22/2000
Proceedings of the 8th International Workshop on Non-Monotonic Reasoning, NMR'2000
The papers gathered in this collection were presented at the 8th Interna...
research
∙
03/14/2000
dcs: An Implementation of DATALOG with Constraints
Answer-set programming (ASP) has emerged recently as a viable programmin...
research
∙
02/04/2000
On the accuracy and running time of GSAT
Randomized algorithms for deciding satisfiability were shown to be effec...
research
∙
02/03/2000
Uniform semantic treatment of default and autoepistemic logics
We revisit the issue of connections between two leading formalisms in no...
research
∙
02/03/2000
Computing large and small stable models
In this paper, we focus on the problem of existence and computing of sma...
research
∙
01/28/1999
Representation Theory for Default Logic
Default logic can be regarded as a mechanism to represent families of be...
research
∙
01/25/1999
Extremal problems in logic programming and stable model computation
We study the following problem: given a class of logic programs C, deter...
research
∙
09/18/1998
