eng
Schloss Dagstuhl – Leibniz-Zentrum für Informatik
Dagstuhl Seminar Proceedings
1862-4405
2005-09-14
5171
1
23
10.4230/DagSemProc.05171.1
article
05171 Abstracts Collection – Nonmonotonic Reasoning, Answer Set Programming and Constraints
Brewka, Gerhard
Niemelä, Ilkka
Schaub, Torsten
Truszczynski, Miroslaw
Vennekens, Joost
From 24.04.05 to 29.04.05, the Dagstuhl Seminar
05171 ``Nonmonotonic Reasoning, Answer Set Programming and Constraints''
was held in the International Conference and Research Center (IBFI),
Schloss Dagstuhl.
During the seminar, several participants presented their current
research, and ongoing work and open problems were discussed. Abstracts of
the presentations given during the seminar as well as abstracts of
seminar results and ideas are put together in this paper. The first section
describes the seminar topics and goals in general.
Links to extended abstracts or full papers are provided, if available.
https://drops.dagstuhl.de/storage/16dagstuhl-seminar-proceedings/dsp-vol05171/DagSemProc.05171.1/DagSemProc.05171.1.pdf
Knowledge representation
nonmonotonic reasoning
logic programming
answer-set programming
constraints
eng
Schloss Dagstuhl – Leibniz-Zentrum für Informatik
Dagstuhl Seminar Proceedings
1862-4405
2005-09-14
5171
1
2
10.4230/DagSemProc.05171.2
article
05171 Executive Summary – Nonmonotonic Reasoning, Answer Set Programming and Constraints
Brewka, Gerhard
Niemelä, Ilkka
Schaub, Torsten
Truszczynski, Miroslaw
We provide a brief overview of the seminar and comment on most important research themes that emerged.
https://drops.dagstuhl.de/storage/16dagstuhl-seminar-proceedings/dsp-vol05171/DagSemProc.05171.2/DagSemProc.05171.2.pdf
Knowledge representation
nonmonotonic reasoning
logic programming
answer-set programming
constraints
eng
Schloss Dagstuhl – Leibniz-Zentrum für Informatik
Dagstuhl Seminar Proceedings
1862-4405
2005-09-14
5171
1
15
10.4230/DagSemProc.05171.3
article
Answer Set Programming and Combinatorial Voting
Grabos, Rafal
We show how Logic Programming with Ordered
Disjunction (LPOD), the extension of answer
set programming for handling preferences, may
be used for representing and solving collective
decision making problems. We present the
notion of combinatorial vote problem in the
context of LPOD and define various types of
vote rules, used as decision criteria for
determining optimal candidate for a group of voters.
15 min presentation
https://drops.dagstuhl.de/storage/16dagstuhl-seminar-proceedings/dsp-vol05171/DagSemProc.05171.3/DagSemProc.05171.3.pdf
Decision making
answer set programming
preferences
eng
Schloss Dagstuhl – Leibniz-Zentrum für Informatik
Dagstuhl Seminar Proceedings
1862-4405
2005-09-14
5171
1
12
10.4230/DagSemProc.05171.4
article
Modelling and Implementing a Knowledge Base for Checking Medical Invoices with DLV
Kern-Isberner, Gabriele
Beierle, Christoph
Dusso, Oliver
Checking medical invoices, done by every health insurance company,
is a labor-intensive task. Both speed and quality of executing
this task may be increased by the knowledge-based
decision support system ACMI which we present
in this paper.
As the relevant regulations also contain various default rules,
ACMI`s knowledge core is modelled
using the answer set programming paradigm. It turned out
that all relevant rules could be expressed directly in this framework,
providing for a declarative and easily extendable and
modifiable knowledge base.
ACMI is implemented using the DLV system.
https://drops.dagstuhl.de/storage/16dagstuhl-seminar-proceedings/dsp-vol05171/DagSemProc.05171.4/DagSemProc.05171.4.pdf
Answer sets
default rules
health insurance
rule schemas
eng
Schloss Dagstuhl – Leibniz-Zentrum für Informatik
Dagstuhl Seminar Proceedings
1862-4405
2005-09-14
5171
1
34
10.4230/DagSemProc.05171.5
article
Normal Form Theorem for Logic Programs with Cardinality Constraints
Marek, Victor W.
Remmel, Jeffrey B.
We discuss proof schemes, a kind of context-dependent proofs for logic
programs. We show usefullness of these constructs both in the context of
normal logic programs and their generalizations due to Niemela and
collaborators. As an application we show the following result. For every
cardinality-constraint logic program P there is a logic program PÃ‚Â´ with the
same heads, but with bodies consisting of atoms and negated atoms such
that P and PÃ‚Â´ have same stable models. It is worth noting that another
proof of same result can be obtained from the results by Lifschitz and
collaborators.
https://drops.dagstuhl.de/storage/16dagstuhl-seminar-proceedings/dsp-vol05171/DagSemProc.05171.5/DagSemProc.05171.5.pdf
Proof scheme
cardinality constraints
eng
Schloss Dagstuhl – Leibniz-Zentrum für Informatik
Dagstuhl Seminar Proceedings
1862-4405
2005-09-14
5171
1
6
10.4230/DagSemProc.05171.6
article
Possibilistic Stable Models
Nicolas, Pascal
Garcia, Laurent
Stéphan, Igor
We present the main lines of a new framework that we have defined in order to improve the knowledge representation power of Answer Set Programming paradigm.
Our proposal is to use notions from possibility theory to extend the stable model semantics by taking into account a certainty level, expressed in terms of necessity measure, on each rule of a normal logic program.
First of all, we introduce possibilistic definite logic programs and show how to compute the conclusions of such programs both in syntactic and semantic ways. The syntactic handling is done by help of a fix-point operator, the semantic part relies on a possibility distribution on all sets of atoms and the two approaches are shown to be equivalent.
In a second part, we define what is a possibilistic stable model for a normal logic program, with default negation. Again, we define a possibility distribution allowing to determine the stable models.
We end our presentation by showing how we can use our framework to adressing inconsistency in Answer Set Programming.
https://drops.dagstuhl.de/storage/16dagstuhl-seminar-proceedings/dsp-vol05171/DagSemProc.05171.6/DagSemProc.05171.6.pdf
Non monotonic reasoning
uncertainty
possibility theory
eng
Schloss Dagstuhl – Leibniz-Zentrum für Informatik
Dagstuhl Seminar Proceedings
1862-4405
2005-09-14
5171
1
6
10.4230/DagSemProc.05171.7
article
Semantic Web Languages and Semantic Web Services as Application Areas for Answer Set Programming
Polleres, Axel
In the Semantic Web and Semantic Web Services areas there are still unclear issues concerning an appropriate language. Answer Set Programming and ASP engines can be particularly interesting for Ontological Reasoning, especially in the light of ongoing discussions of non-Monotonic extensions for Ontology Languages. Previously, the main concern of discussions was around OWL and Description Logics. Recently many extensions and suggestions for Rule Languages and Semantic Web Languages pop up, particularly in the the context of Semantic Web Services, which involve the meta-data description of Services instaead of static data on the Web only. These lanuages involve SWRL, WSML, SWSL-Rules, etc. I want to give an outline of languages, challenges and initiatives in this area and where I think Answer Set Programming research can hook in. (30min).
https://drops.dagstuhl.de/storage/16dagstuhl-seminar-proceedings/dsp-vol05171/DagSemProc.05171.7/DagSemProc.05171.7.pdf
Semantic Web
Semantic Web Services
Rule Lagnuages
RDF
RDFS
OWL
WSMO
WSML
OWL-S
SWSL
SWSF
eng
Schloss Dagstuhl – Leibniz-Zentrum für Informatik
Dagstuhl Seminar Proceedings
1862-4405
2005-09-14
5171
1
26
10.4230/DagSemProc.05171.8
article
Set Based Logic Programming
Remmel, Jeffrey B.
Marek, Victor W.
We propose a set of desiderata for extensions of Answer Set Programming to capture domains where the objects of interest are infinite sets and yet we can still process ASP programs effectively. We propose two different schemes to do this. One is to extend cardinality type constraints to set constraints which involve codes for finite, recursive and recursively enumerable sets. A second scheme to modify logic programming to reason about sets directly. In this setting, we can also augment logic programming with certain
monotone inductive operators so that we can reason about families of sets which have structure such a closed sets of a topological space or
subspaces of a vector space. We observe that under such conditions, the classic Gelfond-Lifschitz construction generalizes to at least two different notions of stable models.
https://drops.dagstuhl.de/storage/16dagstuhl-seminar-proceedings/dsp-vol05171/DagSemProc.05171.8/DagSemProc.05171.8.pdf
ASP
codes for infinite sets
stable model generalizations