Dagstuhl Seminar Proceedings, Volume 5171



Publication Details

  • published at: 2005-09-14
  • Publisher: Schloss Dagstuhl – Leibniz-Zentrum für Informatik

Access Numbers

Documents

No documents found matching your filter selection.
Document
05171 Abstracts Collection – Nonmonotonic Reasoning, Answer Set Programming and Constraints

Authors: Gerhard Brewka, Ilkka Niemelä, Torsten Schaub, Miroslaw Truszczynski, and Joost Vennekens


Abstract
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.

Cite as

Gerhard Brewka, Ilkka Niemelä, Torsten Schaub, Miroslaw Truszczynski, and Joost Vennekens. 05171 Abstracts Collection – Nonmonotonic Reasoning, Answer Set Programming and Constraints. In Nonmonotonic Reasoning, Answer Set Programming and Constraints. Dagstuhl Seminar Proceedings, Volume 5171, pp. 1-23, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2005)


Copy BibTex To Clipboard

@InProceedings{brewka_et_al:DagSemProc.05171.1,
  author =	{Brewka, Gerhard and Niemel\"{a}, Ilkka and Schaub, Torsten and Truszczynski, Miroslaw and Vennekens, Joost},
  title =	{{05171 Abstracts Collection – Nonmonotonic Reasoning, Answer Set Programming and Constraints}},
  booktitle =	{Nonmonotonic Reasoning, Answer Set Programming and Constraints},
  pages =	{1--23},
  series =	{Dagstuhl Seminar Proceedings (DagSemProc)},
  ISSN =	{1862-4405},
  year =	{2005},
  volume =	{5171},
  editor =	{Gerhard Brewka and Ilkka Niemel\"{a} and Torsten Schaub and Miroslaw Truszczynski},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/DagSemProc.05171.1},
  URN =		{urn:nbn:de:0030-drops-2690},
  doi =		{10.4230/DagSemProc.05171.1},
  annote =	{Keywords: Knowledge representation, nonmonotonic reasoning, logic programming, answer-set programming, constraints}
}
Document
05171 Executive Summary – Nonmonotonic Reasoning, Answer Set Programming and Constraints

Authors: Gerhard Brewka, Ilkka Niemelä, Torsten Schaub, and Miroslaw Truszczynski


Abstract
We provide a brief overview of the seminar and comment on most important research themes that emerged.

Cite as

Gerhard Brewka, Ilkka Niemelä, Torsten Schaub, and Miroslaw Truszczynski. 05171 Executive Summary – Nonmonotonic Reasoning, Answer Set Programming and Constraints. In Nonmonotonic Reasoning, Answer Set Programming and Constraints. Dagstuhl Seminar Proceedings, Volume 5171, pp. 1-2, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2005)


Copy BibTex To Clipboard

@InProceedings{brewka_et_al:DagSemProc.05171.2,
  author =	{Brewka, Gerhard and Niemel\"{a}, Ilkka and Schaub, Torsten and Truszczynski, Miroslaw},
  title =	{{05171 Executive Summary – Nonmonotonic Reasoning, Answer Set Programming and Constraints}},
  booktitle =	{Nonmonotonic Reasoning, Answer Set Programming and Constraints},
  pages =	{1--2},
  series =	{Dagstuhl Seminar Proceedings (DagSemProc)},
  ISSN =	{1862-4405},
  year =	{2005},
  volume =	{5171},
  editor =	{Gerhard Brewka and Ilkka Niemel\"{a} and Torsten Schaub and Miroslaw Truszczynski},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/DagSemProc.05171.2},
  URN =		{urn:nbn:de:0030-drops-2607},
  doi =		{10.4230/DagSemProc.05171.2},
  annote =	{Keywords: Knowledge representation, nonmonotonic reasoning, logic programming, answer-set programming, constraints}
}
Document
Answer Set Programming and Combinatorial Voting

Authors: Rafal Grabos


Abstract
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

Cite as

Rafal Grabos. Answer Set Programming and Combinatorial Voting. In Nonmonotonic Reasoning, Answer Set Programming and Constraints. Dagstuhl Seminar Proceedings, Volume 5171, pp. 1-15, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2005)


Copy BibTex To Clipboard

@InProceedings{grabos:DagSemProc.05171.3,
  author =	{Grabos, Rafal},
  title =	{{Answer Set Programming and Combinatorial Voting}},
  booktitle =	{Nonmonotonic Reasoning, Answer Set Programming and Constraints},
  pages =	{1--15},
  series =	{Dagstuhl Seminar Proceedings (DagSemProc)},
  ISSN =	{1862-4405},
  year =	{2005},
  volume =	{5171},
  editor =	{Gerhard Brewka and Ilkka Niemel\"{a} and Torsten Schaub and Miroslaw Truszczynski},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/DagSemProc.05171.3},
  URN =		{urn:nbn:de:0030-drops-2624},
  doi =		{10.4230/DagSemProc.05171.3},
  annote =	{Keywords: Decision making, answer set programming, preferences}
}
Document
Modelling and Implementing a Knowledge Base for Checking Medical Invoices with DLV

Authors: Gabriele Kern-Isberner, Christoph Beierle, and Oliver Dusso


Abstract
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.

Cite as

Gabriele Kern-Isberner, Christoph Beierle, and Oliver Dusso. Modelling and Implementing a Knowledge Base for Checking Medical Invoices with DLV. In Nonmonotonic Reasoning, Answer Set Programming and Constraints. Dagstuhl Seminar Proceedings, Volume 5171, pp. 1-12, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2005)


Copy BibTex To Clipboard

@InProceedings{kernisberner_et_al:DagSemProc.05171.4,
  author =	{Kern-Isberner, Gabriele and Beierle, Christoph and Dusso, Oliver},
  title =	{{Modelling and Implementing a Knowledge Base for Checking Medical Invoices with DLV}},
  booktitle =	{Nonmonotonic Reasoning, Answer Set Programming and Constraints},
  pages =	{1--12},
  series =	{Dagstuhl Seminar Proceedings (DagSemProc)},
  ISSN =	{1862-4405},
  year =	{2005},
  volume =	{5171},
  editor =	{Gerhard Brewka and Ilkka Niemel\"{a} and Torsten Schaub and Miroslaw Truszczynski},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/DagSemProc.05171.4},
  URN =		{urn:nbn:de:0030-drops-2610},
  doi =		{10.4230/DagSemProc.05171.4},
  annote =	{Keywords: Answer sets, default rules, health insurance, rule schemas}
}
Document
Normal Form Theorem for Logic Programs with Cardinality Constraints

Authors: Victor W. Marek and Jeffrey B. Remmel


Abstract
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.

Cite as

Victor W. Marek and Jeffrey B. Remmel. Normal Form Theorem for Logic Programs with Cardinality Constraints. In Nonmonotonic Reasoning, Answer Set Programming and Constraints. Dagstuhl Seminar Proceedings, Volume 5171, pp. 1-34, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2005)


Copy BibTex To Clipboard

@InProceedings{marek_et_al:DagSemProc.05171.5,
  author =	{Marek, Victor W. and Remmel, Jeffrey B.},
  title =	{{Normal Form Theorem for Logic Programs with Cardinality Constraints}},
  booktitle =	{Nonmonotonic Reasoning, Answer Set Programming and Constraints},
  pages =	{1--34},
  series =	{Dagstuhl Seminar Proceedings (DagSemProc)},
  ISSN =	{1862-4405},
  year =	{2005},
  volume =	{5171},
  editor =	{Gerhard Brewka and Ilkka Niemel\"{a} and Torsten Schaub and Miroslaw Truszczynski},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/DagSemProc.05171.5},
  URN =		{urn:nbn:de:0030-drops-2598},
  doi =		{10.4230/DagSemProc.05171.5},
  annote =	{Keywords: Proof scheme, cardinality constraints}
}
Document
Possibilistic Stable Models

Authors: Pascal Nicolas, Laurent Garcia, and Igor Stéphan


Abstract
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.

Cite as

Pascal Nicolas, Laurent Garcia, and Igor Stéphan. Possibilistic Stable Models. In Nonmonotonic Reasoning, Answer Set Programming and Constraints. Dagstuhl Seminar Proceedings, Volume 5171, pp. 1-6, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2005)


Copy BibTex To Clipboard

@InProceedings{nicolas_et_al:DagSemProc.05171.6,
  author =	{Nicolas, Pascal and Garcia, Laurent and St\'{e}phan, Igor},
  title =	{{Possibilistic Stable Models}},
  booktitle =	{Nonmonotonic Reasoning, Answer Set Programming and Constraints},
  pages =	{1--6},
  series =	{Dagstuhl Seminar Proceedings (DagSemProc)},
  ISSN =	{1862-4405},
  year =	{2005},
  volume =	{5171},
  editor =	{Gerhard Brewka and Ilkka Niemel\"{a} and Torsten Schaub and Miroslaw Truszczynski},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/DagSemProc.05171.6},
  URN =		{urn:nbn:de:0030-drops-2641},
  doi =		{10.4230/DagSemProc.05171.6},
  annote =	{Keywords: Non monotonic reasoning, uncertainty, possibility theory}
}
Document
Semantic Web Languages and Semantic Web Services as Application Areas for Answer Set Programming

Authors: Axel Polleres


Abstract
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).

Cite as

Axel Polleres. Semantic Web Languages and Semantic Web Services as Application Areas for Answer Set Programming. In Nonmonotonic Reasoning, Answer Set Programming and Constraints. Dagstuhl Seminar Proceedings, Volume 5171, pp. 1-6, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2005)


Copy BibTex To Clipboard

@InProceedings{polleres:DagSemProc.05171.7,
  author =	{Polleres, Axel},
  title =	{{Semantic Web Languages and Semantic Web Services as Application Areas for Answer Set Programming}},
  booktitle =	{Nonmonotonic Reasoning, Answer Set Programming and Constraints},
  pages =	{1--6},
  series =	{Dagstuhl Seminar Proceedings (DagSemProc)},
  ISSN =	{1862-4405},
  year =	{2005},
  volume =	{5171},
  editor =	{Gerhard Brewka and Ilkka Niemel\"{a} and Torsten Schaub and Miroslaw Truszczynski},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/DagSemProc.05171.7},
  URN =		{urn:nbn:de:0030-drops-2631},
  doi =		{10.4230/DagSemProc.05171.7},
  annote =	{Keywords: Semantic Web, Semantic Web Services, Rule Lagnuages, RDF, RDFS, OWL, WSMO, WSML, OWL-S, SWSL, SWSF}
}
Document
Set Based Logic Programming

Authors: Jeffrey B. Remmel and Victor W. Marek


Abstract
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.

Cite as

Jeffrey B. Remmel and Victor W. Marek. Set Based Logic Programming. In Nonmonotonic Reasoning, Answer Set Programming and Constraints. Dagstuhl Seminar Proceedings, Volume 5171, pp. 1-26, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2005)


Copy BibTex To Clipboard

@InProceedings{remmel_et_al:DagSemProc.05171.8,
  author =	{Remmel, Jeffrey B. and Marek, Victor W.},
  title =	{{Set Based Logic Programming}},
  booktitle =	{Nonmonotonic Reasoning, Answer Set Programming and Constraints},
  pages =	{1--26},
  series =	{Dagstuhl Seminar Proceedings (DagSemProc)},
  ISSN =	{1862-4405},
  year =	{2005},
  volume =	{5171},
  editor =	{Gerhard Brewka and Ilkka Niemel\"{a} and Torsten Schaub and Miroslaw Truszczynski},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/DagSemProc.05171.8},
  URN =		{urn:nbn:de:0030-drops-2667},
  doi =		{10.4230/DagSemProc.05171.8},
  annote =	{Keywords: ASP, codes for infinite sets, stable model generalizations}
}

Filters


Questions / Remarks / Feedback
X

Feedback for Dagstuhl Publishing


Thanks for your feedback!

Feedback submitted

Could not send message

Please try again later or send an E-mail