Volume

LIPIcs, Volume 11

Technical Communications of the 27th International Conference on Logic Programming (ICLP'11)

Thumbnail PDF

Event

ICLP 2011, July 6-10, 2011, Lexington, Kentucky, USA

Editors

John P. Gallagher
Michael Gelfond

Publication Details

  • published at: 2011-06-27
  • Publisher: Schloss Dagstuhl – Leibniz-Zentrum für Informatik
  • ISBN: 978-3-939897-31-6
  • DBLP: db/conf/iclp/iclp2011

Access Numbers

Documents

No documents found matching your filter selection.
Document
Complete Volume
DOI: 10.4230/LIPIcs.ICLP.2011
LIPIcs, Volume 11, ICLP'11, Complete Volume

Authors: John P. Gallagher and Michael Gelfond

Abstract
LIPIcs, Volume 11, ICLP'11, Complete Volume
Cite as

Technical Communications of the 27th International Conference on Logic Programming (ICLP'11). Leibniz International Proceedings in Informatics (LIPIcs), Volume 11, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2013)

Copy BibTex To Clipboard

@Proceedings{gallagher_et_al:LIPIcs.ICLP.2011,
  title =	{{LIPIcs, Volume 11, ICLP'11, Complete Volume}},
  booktitle =	{Technical Communications of the 27th International Conference on Logic Programming (ICLP'11)},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-939897-31-6},
  ISSN =	{1868-8969},
  year =	{2013},
  volume =	{11},
  editor =	{Gallagher, John P. and Gelfond, Michael},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICLP.2011},
  URN =		{urn:nbn:de:0030-drops-41055},
  doi =		{10.4230/LIPIcs.ICLP.2011},
  annote =	{Keywords: Logic Programming, Software Engineering, Mathematical Logic, Knowledge Representation Formalisms and Methods, Problem Solving, Control Methods, and Se}
}
Document
Front Matter
DOI: 10.4230/LIPIcs.ICLP.2011.i
Frontmatter, Table of Contents, Preface, Conference Organization

Authors: John P. Gallagher and Michael Gelfond

Abstract
Frontmatter, Table of Contents, Preface, Conference Organization
Cite as

Technical Communications of the 27th International Conference on Logic Programming (ICLP'11). Leibniz International Proceedings in Informatics (LIPIcs), Volume 11, pp. i-ix, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2011)

Copy BibTex To Clipboard

@InProceedings{gallagher_et_al:LIPIcs.ICLP.2011.i,
  author =	{Gallagher, John P. and Gelfond, Michael},
  title =	{{Frontmatter, Table of Contents, Preface, Conference Organization}},
  booktitle =	{Technical Communications of the 27th International Conference on Logic Programming (ICLP'11)},
  pages =	{i--ix},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-939897-31-6},
  ISSN =	{1868-8969},
  year =	{2011},
  volume =	{11},
  editor =	{Gallagher, John P. and Gelfond, Michael},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICLP.2011.i},
  URN =		{urn:nbn:de:0030-drops-31581},
  doi =		{10.4230/LIPIcs.ICLP.2011.i},
  annote =	{Keywords: Frontmatter, Table of Contents, Preface, Conference Organization}
}
Document
DOI: 10.4230/LIPIcs.ICLP.2011.1
Multi-Criteria Optimization in Answer Set Programming

Authors: Martin Gebser, Roland Kaminski, Benjamin Kaufmann, and Torsten Schaub

Abstract
We elaborate upon new strategies and heuristics for solving multi-criteria optimization problems via Answer Set Programming (ASP). In particular, we conceive a new solving algorithm, based on conflictdriven learning, allowing for non-uniform descents during optimization. We apply these techniques to solve realistic Linux package configuration problems. To this end, we describe the Linux package configuration tool aspcud and compare its performance with systems pursuing alternative approaches.
Cite as

Martin Gebser, Roland Kaminski, Benjamin Kaufmann, and Torsten Schaub. Multi-Criteria Optimization in Answer Set Programming. In Technical Communications of the 27th International Conference on Logic Programming (ICLP'11). Leibniz International Proceedings in Informatics (LIPIcs), Volume 11, pp. 1-10, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2011)

Copy BibTex To Clipboard

@InProceedings{gebser_et_al:LIPIcs.ICLP.2011.1,
  author =	{Gebser, Martin and Kaminski, Roland and Kaufmann, Benjamin and Schaub, Torsten},
  title =	{{Multi-Criteria Optimization in Answer Set Programming}},
  booktitle =	{Technical Communications of the 27th International Conference on Logic Programming (ICLP'11)},
  pages =	{1--10},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-939897-31-6},
  ISSN =	{1868-8969},
  year =	{2011},
  volume =	{11},
  editor =	{Gallagher, John P. and Gelfond, Michael},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICLP.2011.1},
  URN =		{urn:nbn:de:0030-drops-31617},
  doi =		{10.4230/LIPIcs.ICLP.2011.1},
  annote =	{Keywords: Answer Set Programming, Multi-Criteria Optimization, Linux Package Configuration}
}
Document
DOI: 10.4230/LIPIcs.ICLP.2011.11
Yet Another Characterization of Strong Equivalence

Authors: Alexander Bochman and Vladimir Lifschitz

Abstract
Strong equivalence of disjunctive logic programs is characterized here by a calculus that operates with syntactically simple formulas.
Cite as

Alexander Bochman and Vladimir Lifschitz. Yet Another Characterization of Strong Equivalence. In Technical Communications of the 27th International Conference on Logic Programming (ICLP'11). Leibniz International Proceedings in Informatics (LIPIcs), Volume 11, pp. 11-15, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2011)

Copy BibTex To Clipboard

@InProceedings{bochman_et_al:LIPIcs.ICLP.2011.11,
  author =	{Bochman, Alexander and Lifschitz, Vladimir},
  title =	{{Yet Another Characterization of Strong Equivalence}},
  booktitle =	{Technical Communications of the 27th International Conference on Logic Programming (ICLP'11)},
  pages =	{11--15},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-939897-31-6},
  ISSN =	{1868-8969},
  year =	{2011},
  volume =	{11},
  editor =	{Gallagher, John P. and Gelfond, Michael},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICLP.2011.11},
  URN =		{urn:nbn:de:0030-drops-31674},
  doi =		{10.4230/LIPIcs.ICLP.2011.11},
  annote =	{Keywords: Strong equivalence, logic program}
}
Document
DOI: 10.4230/LIPIcs.ICLP.2011.16
Evolution of Ontologies using ASP

Authors: Max Ostrowski, Giorgos Flouris, Torsten Schaub, and Grigoris Antoniou

Abstract
RDF/S ontologies are often used in e-science to express domain knowledge regarding the respective field of investigation (e.g., cultural informatics, bioinformatics etc). Such ontologies need to change often to reflect the latest scientific understanding on the domain at hand, and are usually associated with constraints expressed using various declarative formalisms to express domain-specific requirements, such as cardinality or acyclicity constraints. Addressing the evolution of ontologies in the presence of ontological constraints imposes extra difficulties, because it forces us to respect the associated constraints during evolution. While these issues were addressed in previous work, this is the first work to examine how ASP techniques can be applied to model and implement the evolution process. ASP was chosen for its advantages in terms of a principled, rather than ad hoc implementation, its modularity and flexibility, and for being a state-of-the-art technique to tackle hard combinatorial problems. In particular, our approach consists in providing a general translation of the problem into ASP, thereby reducing it to an instance of an ASP program that can be solved by an ASP solver. Our experiments are promising, even for large ontologies, and also show that the scalability of the approach depends on the morphology of the input.
Cite as

Max Ostrowski, Giorgos Flouris, Torsten Schaub, and Grigoris Antoniou. Evolution of Ontologies using ASP. In Technical Communications of the 27th International Conference on Logic Programming (ICLP'11). Leibniz International Proceedings in Informatics (LIPIcs), Volume 11, pp. 16-27, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2011)

Copy BibTex To Clipboard

@InProceedings{ostrowski_et_al:LIPIcs.ICLP.2011.16,
  author =	{Ostrowski, Max and Flouris, Giorgos and Schaub, Torsten and Antoniou, Grigoris},
  title =	{{Evolution of Ontologies using ASP}},
  booktitle =	{Technical Communications of the 27th International Conference on Logic Programming (ICLP'11)},
  pages =	{16--27},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-939897-31-6},
  ISSN =	{1868-8969},
  year =	{2011},
  volume =	{11},
  editor =	{Gallagher, John P. and Gelfond, Michael},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICLP.2011.16},
  URN =		{urn:nbn:de:0030-drops-31747},
  doi =		{10.4230/LIPIcs.ICLP.2011.16},
  annote =	{Keywords: Ontology evolution, Evolution in the presence of constraints, incremental ASP application}
}
Document
DOI: 10.4230/LIPIcs.ICLP.2011.28
Modelling Grammar Constraints with Answer Set Programming

Authors: Christian Drescher and Toby Walsh

Abstract
Representing and solving constraint satisfaction problems is one of the challenges of artificial intelligence. In this paper, we present answer set programming (ASP) models for an important and very general class of constraints, including all constraints specified via grammars or automata that recognise some formal language. We argue that our techniques are effective and efficient, e.g., unit-propagation of an ASP solver can achieve domain consistency on the original constraint. Experiments demonstrate computational impact.
Cite as

Christian Drescher and Toby Walsh. Modelling Grammar Constraints with Answer Set Programming. In Technical Communications of the 27th International Conference on Logic Programming (ICLP'11). Leibniz International Proceedings in Informatics (LIPIcs), Volume 11, pp. 28-39, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2011)

Copy BibTex To Clipboard

@InProceedings{drescher_et_al:LIPIcs.ICLP.2011.28,
  author =	{Drescher, Christian and Walsh, Toby},
  title =	{{Modelling Grammar Constraints with Answer Set Programming}},
  booktitle =	{Technical Communications of the 27th International Conference on Logic Programming (ICLP'11)},
  pages =	{28--39},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-939897-31-6},
  ISSN =	{1868-8969},
  year =	{2011},
  volume =	{11},
  editor =	{Gallagher, John P. and Gelfond, Michael},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICLP.2011.28},
  URN =		{urn:nbn:de:0030-drops-31723},
  doi =		{10.4230/LIPIcs.ICLP.2011.28},
  annote =	{Keywords: answer set programming, grammar-, regular-, precedence constraint}
}
Document
DOI: 10.4230/LIPIcs.ICLP.2011.40
Hybrid ASP

Authors: Alex Brik and Jeffrey B. Remmel

Abstract
This paper introduces an extension of Answer Set Programming (ASP) called Hybrid ASP which will allow the user to reason about dynamical systems that exhibit both discrete and continuous aspects. The unique feature of Hybrid ASP is that it allows the use of ASP type rules as controls for when to apply algorithms to advance the system to the next position. That is, if the prerequisites of a rule are satisfied and the constraints of the rule are not violated, then the algorithm associated with the rule is invoked.
Cite as

Alex Brik and Jeffrey B. Remmel. Hybrid ASP. In Technical Communications of the 27th International Conference on Logic Programming (ICLP'11). Leibniz International Proceedings in Informatics (LIPIcs), Volume 11, pp. 40-50, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2011)

Copy BibTex To Clipboard

@InProceedings{brik_et_al:LIPIcs.ICLP.2011.40,
  author =	{Brik, Alex and Remmel, Jeffrey B.},
  title =	{{Hybrid ASP}},
  booktitle =	{Technical Communications of the 27th International Conference on Logic Programming (ICLP'11)},
  pages =	{40--50},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-939897-31-6},
  ISSN =	{1868-8969},
  year =	{2011},
  volume =	{11},
  editor =	{Gallagher, John P. and Gelfond, Michael},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICLP.2011.40},
  URN =		{urn:nbn:de:0030-drops-31790},
  doi =		{10.4230/LIPIcs.ICLP.2011.40},
  annote =	{Keywords: answer set programming, hybrid systems, modeling and simulation}
}
Document
DOI: 10.4230/LIPIcs.ICLP.2011.51
Representing the Language of the Causal Calculator in Answer Set Programming

Authors: Michael Casolary and Joohyung Lee

Abstract
Action language C+, a formalism based on nonmonotonic causal logic, was designed for describing properties of actions. The definite fragment of C+ was implemented in system the Causal Calculator (CCalc), based on a reduction of nonmonotonic causal logic to propositional logic. On the other hand, in this paper, we represent the language of CCalc in answer set programming (ASP), by translating nonmonotonic causal logic into formulas under the stable model semantics. We design a standard library which describes the constructs of the input language of CCalc in terms of ASP, allowing a simple modular method to represent CCalc input programs in the language of ASP. Using the combination of system f2lp and answer set solvers, our prototype implementation of this approach, which we call Cplus2ASP, achieves functionality close to CCalc while taking advantage of answer set solvers to yield efficient computation that is orders of magnitude faster than CCalc on several benchmark examples.
Cite as

Michael Casolary and Joohyung Lee. Representing the Language of the Causal Calculator in Answer Set Programming. In Technical Communications of the 27th International Conference on Logic Programming (ICLP'11). Leibniz International Proceedings in Informatics (LIPIcs), Volume 11, pp. 51-61, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2011)

Copy BibTex To Clipboard

@InProceedings{casolary_et_al:LIPIcs.ICLP.2011.51,
  author =	{Casolary, Michael and Lee, Joohyung},
  title =	{{Representing the Language of the Causal Calculator in Answer Set Programming}},
  booktitle =	{Technical Communications of the 27th International Conference on Logic Programming (ICLP'11)},
  pages =	{51--61},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-939897-31-6},
  ISSN =	{1868-8969},
  year =	{2011},
  volume =	{11},
  editor =	{Gallagher, John P. and Gelfond, Michael},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICLP.2011.51},
  URN =		{urn:nbn:de:0030-drops-31780},
  doi =		{10.4230/LIPIcs.ICLP.2011.51},
  annote =	{Keywords: answer set programming, nonmonotonic causal logic, action languages}
}
Document
DOI: 10.4230/LIPIcs.ICLP.2011.62
Static Type Checking for the Q Functional Language in Prolog

Authors: Zsolt Zombori, János Csorba, and Péter Szeredi

Abstract
We describe an application of Prolog: a type checking tool for the Q functional language. Q is a terse vector processing language, a descendant of APL, which is getting more and more popular, especially in financial applications. Q is a dynamically typed language, much like Prolog. Extending Q with static typing improves both the readability of programs and programmer productivity, as type errors are discovered by the tool at compile time, rather than through debugging the program execution. We designed a type description syntax for Q and implemented a parser for both the Q language and its type extension. We then implemented a type checking algorithm using constraints. As most built-in function names of Q are overloaded, i.e. their meaning depends on the argument types, a quite complex system of constraints had to be implemented. Prolog proved to be an ideal implementation language for the task at hand. We used Definite Clause Grammars for parsing and Constraint Handling Rules for the type checking algorithm. In the paper we describe the main problems solved and the experiences gained in the development of the type checking tool.
Cite as

Zsolt Zombori, János Csorba, and Péter Szeredi. Static Type Checking for the Q Functional Language in Prolog. In Technical Communications of the 27th International Conference on Logic Programming (ICLP'11). Leibniz International Proceedings in Informatics (LIPIcs), Volume 11, pp. 62-72, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2011)

Copy BibTex To Clipboard

@InProceedings{zombori_et_al:LIPIcs.ICLP.2011.62,
  author =	{Zombori, Zsolt and Csorba, J\'{a}nos and Szeredi, P\'{e}ter},
  title =	{{Static Type Checking for the Q Functional Language in Prolog}},
  booktitle =	{Technical Communications of the 27th International Conference on Logic Programming (ICLP'11)},
  pages =	{62--72},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-939897-31-6},
  ISSN =	{1868-8969},
  year =	{2011},
  volume =	{11},
  editor =	{Gallagher, John P. and Gelfond, Michael},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICLP.2011.62},
  URN =		{urn:nbn:de:0030-drops-31718},
  doi =		{10.4230/LIPIcs.ICLP.2011.62},
  annote =	{Keywords: logic programming, types, static type checking, constraints, CHR, DCG}
}
Document
DOI: 10.4230/LIPIcs.ICLP.2011.73
Canonical Regular Types

Authors: Ethan K. Jackson, Nikolaj Bjørner, and Wolfram Schulte

Abstract
Regular types represent sets of structured data, and have been used in logic programming (LP) for verification. However, first-class regular type systems are uncommon in LP languages. In this paper we present a new approach to regular types, based on type canonization, aimed at providing a practical first-class regular type system.
Cite as

Ethan K. Jackson, Nikolaj Bjørner, and Wolfram Schulte. Canonical Regular Types. In Technical Communications of the 27th International Conference on Logic Programming (ICLP'11). Leibniz International Proceedings in Informatics (LIPIcs), Volume 11, pp. 73-83, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2011)

Copy BibTex To Clipboard

@InProceedings{jackson_et_al:LIPIcs.ICLP.2011.73,
  author =	{Jackson, Ethan K. and Bj{\o}rner, Nikolaj and Schulte, Wolfram},
  title =	{{Canonical Regular Types}},
  booktitle =	{Technical Communications of the 27th International Conference on Logic Programming (ICLP'11)},
  pages =	{73--83},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-939897-31-6},
  ISSN =	{1868-8969},
  year =	{2011},
  volume =	{11},
  editor =	{Gallagher, John P. and Gelfond, Michael},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICLP.2011.73},
  URN =		{urn:nbn:de:0030-drops-31806},
  doi =		{10.4230/LIPIcs.ICLP.2011.73},
  annote =	{Keywords: Regular types, Canonical forms, Type canonizer}
}
Document
DOI: 10.4230/LIPIcs.ICLP.2011.84
Compiling Prolog to Idiomatic Java

Authors: Michael Eichberg

Abstract
Today, Prolog is often used to solve well-defined, domain-specific problems that are part of larger applications. In such cases, a tight integration of the Prolog program and the rest of the application, which is commonly written in a different language, is necessary. One common approach is to compile the Prolog code to (native) code in the target language. In this case, the effort necessary to build, test and deploy the final application is reduced. However, most of the approaches that achieve reasonable performance compile Prolog to object-oriented code that relies on some kind of virtual machine (VM). These VMs are libraries implemented in the target language and implement Prolog's execution semantics. This adds a significant layer to the object-oriented program and results in code that does not look and feel native to developers of object-oriented programs. Further, if Prolog's execution semantics is implemented as a library the potential of modern runtime environments for object-oriented programs, such as the Java Virtual Machine, to effectively optimize the program is more limited. In this paper, we report on our approach to compile Prolog to high-level, idiomatic object-oriented Java code. The generated Java code closely resembles code written by Java developers and is effectively optimized by the Java Virtual Machine.
Cite as

Michael Eichberg. Compiling Prolog to Idiomatic Java. In Technical Communications of the 27th International Conference on Logic Programming (ICLP'11). Leibniz International Proceedings in Informatics (LIPIcs), Volume 11, pp. 84-94, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2011)

Copy BibTex To Clipboard

@InProceedings{eichberg:LIPIcs.ICLP.2011.84,
  author =	{Eichberg, Michael},
  title =	{{Compiling Prolog to Idiomatic Java}},
  booktitle =	{Technical Communications of the 27th International Conference on Logic Programming (ICLP'11)},
  pages =	{84--94},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-939897-31-6},
  ISSN =	{1868-8969},
  year =	{2011},
  volume =	{11},
  editor =	{Gallagher, John P. and Gelfond, Michael},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICLP.2011.84},
  URN =		{urn:nbn:de:0030-drops-31763},
  doi =		{10.4230/LIPIcs.ICLP.2011.84},
  annote =	{Keywords: Prolog, Compiling, Logic Programming, Object-oriented Programming}
}
Document
DOI: 10.4230/LIPIcs.ICLP.2011.95
Synthesis of Logic Programs from Object-Oriented Formal Specifications

Authors: Ángel Herranz and Julio Mariño

Abstract
Early validation of requirements is crucial for the rigorous development of software. Without it, even the most formal of the methodologies will produce the wrong outcome. One successful approach, popularised by some of the so-called lightweight formal methods, consists in generating (finite, small) models of the specifications. Another possibility is to build a running prototype from those specifications. In this paper we show how to obtain executable prototypes from formal specifications written in an object oriented notation by translating them into logic programs. This has some advantages over other lightweight methodologies. For instance, we recover the possibility of dealing with recursive data types as specifications that use them often lack finite models.
Cite as

Ángel Herranz and Julio Mariño. Synthesis of Logic Programs from Object-Oriented Formal Specifications. In Technical Communications of the 27th International Conference on Logic Programming (ICLP'11). Leibniz International Proceedings in Informatics (LIPIcs), Volume 11, pp. 95-105, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2011)

Copy BibTex To Clipboard

@InProceedings{herranz_et_al:LIPIcs.ICLP.2011.95,
  author =	{Herranz, \'{A}ngel and Mari\~{n}o, Julio},
  title =	{{Synthesis of Logic Programs from Object-Oriented Formal Specifications}},
  booktitle =	{Technical Communications of the 27th International Conference on Logic Programming (ICLP'11)},
  pages =	{95--105},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-939897-31-6},
  ISSN =	{1868-8969},
  year =	{2011},
  volume =	{11},
  editor =	{Gallagher, John P. and Gelfond, Michael},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICLP.2011.95},
  URN =		{urn:nbn:de:0030-drops-31810},
  doi =		{10.4230/LIPIcs.ICLP.2011.95},
  annote =	{Keywords: Formal Methods, Logic Program Synthesis, Object-Oriented, Executable Specifications, Correct-by-Construction}
}
Document
DOI: 10.4230/LIPIcs.ICLP.2011.106
An Inductive Approach for Modal Transition System Refinement

Authors: Dalal Alrajeh, Jeff Kramer, Alessandra Russo, and Sebastian Uchitel

Abstract
Modal Transition Systems (MTSs) provide an appropriate framework for modelling software behaviour when only a partial specification is available. A key characteristic of an MTS is that it explicitly models events that a system is required to provide and is proscribed from exhibiting, and those for which no specification is available, called maybe events. Incremental elaboration of maybe events into either required or proscribed events can be seen as a process of MTS refinement, resulting from extending a given partial specification with more information about the system behaviour. This paper focuses on providing automated support for computing strong refinements of an MTS with respect to event traces that describe required and proscribed behaviours using a non-monotonic inductive logic programming technique. A real case study is used to illustrate the practical application of the approach.
Cite as

Dalal Alrajeh, Jeff Kramer, Alessandra Russo, and Sebastian Uchitel. An Inductive Approach for Modal Transition System Refinement. In Technical Communications of the 27th International Conference on Logic Programming (ICLP'11). Leibniz International Proceedings in Informatics (LIPIcs), Volume 11, pp. 106-116, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2011)

Copy BibTex To Clipboard

@InProceedings{alrajeh_et_al:LIPIcs.ICLP.2011.106,
  author =	{Alrajeh, Dalal and Kramer, Jeff and Russo, Alessandra and Uchitel, Sebastian},
  title =	{{An Inductive Approach for Modal Transition System Refinement}},
  booktitle =	{Technical Communications of the 27th International Conference on Logic Programming (ICLP'11)},
  pages =	{106--116},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-939897-31-6},
  ISSN =	{1868-8969},
  year =	{2011},
  volume =	{11},
  editor =	{Gallagher, John P. and Gelfond, Michael},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICLP.2011.106},
  URN =		{urn:nbn:de:0030-drops-31758},
  doi =		{10.4230/LIPIcs.ICLP.2011.106},
  annote =	{Keywords: Modal Transition Systems, Refinement, Inductive Logic Programming, Event Calculus}
}
Document
DOI: 10.4230/LIPIcs.ICLP.2011.117
Constraints in Non-Boolean Contexts

Authors: Leslie De Koninck, Sebastian Brand, and Peter J. Stuckey

Abstract
In high-level constraint modelling languages, constraints can occur in non-Boolean contexts: implicitly, in the form of partial functions, or more explicitly, in the form of constraints on local variables in non-Boolean expressions. Specifications using these facilities are often more succinct. However, these specifications are typically executed on solvers that only support questions of the form of existentially quantified conjunctions of constraints. We show how we can translate expressions with constraints appearing in non-Boolean contexts into conjunctions of ordinary constraints. The translation is clearly structured into constrained type elimination, local variable lifting and partial function elimination. We explain our approach in the context of the modelling language Zinc. An implementation of it is an integral part of our Zinc compiler.
Cite as

Leslie De Koninck, Sebastian Brand, and Peter J. Stuckey. Constraints in Non-Boolean Contexts. In Technical Communications of the 27th International Conference on Logic Programming (ICLP'11). Leibniz International Proceedings in Informatics (LIPIcs), Volume 11, pp. 117-127, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2011)

Copy BibTex To Clipboard

@InProceedings{dekoninck_et_al:LIPIcs.ICLP.2011.117,
  author =	{De Koninck, Leslie and Brand, Sebastian and Stuckey, Peter J.},
  title =	{{Constraints in Non-Boolean Contexts}},
  booktitle =	{Technical Communications of the 27th International Conference on Logic Programming (ICLP'11)},
  pages =	{117--127},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-939897-31-6},
  ISSN =	{1868-8969},
  year =	{2011},
  volume =	{11},
  editor =	{Gallagher, John P. and Gelfond, Michael},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICLP.2011.117},
  URN =		{urn:nbn:de:0030-drops-31685},
  doi =		{10.4230/LIPIcs.ICLP.2011.117},
  annote =	{Keywords: Constraint modelling languages, model transformation, partial functions}
}
Document
DOI: 10.4230/LIPIcs.ICLP.2011.128
Minimizing the overheads of dependent {AND}-parallelism

Authors: Peter Wang and Zoltan Somogyi

Abstract
Parallel implementations of programming languages need to control synchronization overheads. Synchronization is essential for ensuring the correctness of parallel code, yet it adds overheads that aren't present in sequential programs. This is an important problem for parallel logic programming systems, because almost every action in such programs requires accessing variables, and the traditional approach of adding synchronization code to all such accesses is so prohibitively expensive that a parallel version of the program may run more slowly on four processors than a sequential version would run on one processor. We present a program transformation for implementing dependent AND-parallelism in logic programming languages that uses mode information to add synchronization code only to the variable accesses that actually need it.
Cite as

Peter Wang and Zoltan Somogyi. Minimizing the overheads of dependent {AND}-parallelism. In Technical Communications of the 27th International Conference on Logic Programming (ICLP'11). Leibniz International Proceedings in Informatics (LIPIcs), Volume 11, pp. 128-138, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2011)

Copy BibTex To Clipboard

@InProceedings{wang_et_al:LIPIcs.ICLP.2011.128,
  author =	{Wang, Peter and Somogyi, Zoltan},
  title =	{{Minimizing the overheads of dependent \{AND\}-parallelism}},
  booktitle =	{Technical Communications of the 27th International Conference on Logic Programming (ICLP'11)},
  pages =	{128--138},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-939897-31-6},
  ISSN =	{1868-8969},
  year =	{2011},
  volume =	{11},
  editor =	{Gallagher, John P. and Gelfond, Michael},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICLP.2011.128},
  URN =		{urn:nbn:de:0030-drops-31667},
  doi =		{10.4230/LIPIcs.ICLP.2011.128},
  annote =	{Keywords: synchronization, program transformation}
}
Document
DOI: 10.4230/LIPIcs.ICLP.2011.139
Smart test data generators via logic programming

Authors: Lukas Bulwahn

Abstract
We present a novel counterexample generator for the interactive theorem prover Isabelle based on a compiler that synthesizes test data generators for functional programming languages (e.g. Standard ML, OCaml) from specifications in Isabelle. In contrast to naive type-based test data generators, the smart generators take the preconditions into account and only generate tests that fulfill the preconditions. The smart generators are constructed by a compiler that reformulates the preconditions as logic programs and analyzes them by an enriched mode inference. From this inference, the compiler can construct the desired generators in the functional programming language. These test data generators are applied to find errors in specifications, as we show in a case study of a hotel key card system.
Cite as

Lukas Bulwahn. Smart test data generators via logic programming. In Technical Communications of the 27th International Conference on Logic Programming (ICLP'11). Leibniz International Proceedings in Informatics (LIPIcs), Volume 11, pp. 139-150, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2011)

Copy BibTex To Clipboard

@InProceedings{bulwahn:LIPIcs.ICLP.2011.139,
  author =	{Bulwahn, Lukas},
  title =	{{Smart test data generators via logic programming}},
  booktitle =	{Technical Communications of the 27th International Conference on Logic Programming (ICLP'11)},
  pages =	{139--150},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-939897-31-6},
  ISSN =	{1868-8969},
  year =	{2011},
  volume =	{11},
  editor =	{Gallagher, John P. and Gelfond, Michael},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICLP.2011.139},
  URN =		{urn:nbn:de:0030-drops-31703},
  doi =		{10.4230/LIPIcs.ICLP.2011.139},
  annote =	{Keywords: specification-based testing, functional programming}
}
Document
DOI: 10.4230/LIPIcs.ICLP.2011.151
Declarative Output by Ordering Text Pieces

Authors: Stefan Brass

Abstract
Most real-world programs must produce output. If a deductive database is used to implement database application programs, it should be possible to specify the output declaratively. There is no generally accepted, completely satisfying solution for this. In this paper we propose to specify an output document by defining the position of text pieces (building blocks of the document). These text pieces are then ordered by their position and concatenated. This way of specifying output fits well to the bottom-up way of thinking about rules (from right to left) which is common in deductive databases. Of course, when evaluating such programs, one wants to avoid sorting operations as far as possible. We show how rules involving ordering can be efficiently implemented.
Cite as

Stefan Brass. Declarative Output by Ordering Text Pieces. In Technical Communications of the 27th International Conference on Logic Programming (ICLP'11). Leibniz International Proceedings in Informatics (LIPIcs), Volume 11, pp. 151-161, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2011)

Copy BibTex To Clipboard

@InProceedings{brass:LIPIcs.ICLP.2011.151,
  author =	{Brass, Stefan},
  title =	{{Declarative Output by Ordering Text Pieces}},
  booktitle =	{Technical Communications of the 27th International Conference on Logic Programming (ICLP'11)},
  pages =	{151--161},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-939897-31-6},
  ISSN =	{1868-8969},
  year =	{2011},
  volume =	{11},
  editor =	{Gallagher, John P. and Gelfond, Michael},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICLP.2011.151},
  URN =		{urn:nbn:de:0030-drops-31770},
  doi =		{10.4230/LIPIcs.ICLP.2011.151},
  annote =	{Keywords: Deductive Databases, Logic Programming, Declarative Output, Bottom-Up Evaluation, Order, Sorting, Implementation}
}
Document
DOI: 10.4230/LIPIcs.ICLP.2011.162
Transaction Logic with Defaults and Argumentation Theories

Authors: Paul Fodor and Michael Kifer

Abstract
Transaction Logic is an extension of classical logic that gracefully integrates both declarative and procedural knowledge and has proved itself as a powerful formalism for many advanced applications, including modeling robot movements, actions specification, and planning in artificial intelligence. In a parallel development, much work has been devoted to various theories of defeasible reasoning. In this paper, we unify these two streams of research and develop Transaction Logic with Defaults and Argumentation Theories, an extension of both Transaction Logic and the recently proposed unifying framework for defeasible reasoning called Logic Programs with Defaults and Argumentation Theories. We show that this combination has a number of interesting applications, including specification of defaults in action theories and heuristics for directed search in artificial intelligence planning problems. We also demonstrate the usefulness of the approach by experimenting with a prototype of the logic and showing how heuristics expressed as defeasible actions can significantly reduce the search space as well as execution time and space requirements.
Cite as

Paul Fodor and Michael Kifer. Transaction Logic with Defaults and Argumentation Theories. In Technical Communications of the 27th International Conference on Logic Programming (ICLP'11). Leibniz International Proceedings in Informatics (LIPIcs), Volume 11, pp. 162-174, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2011)

Copy BibTex To Clipboard

@InProceedings{fodor_et_al:LIPIcs.ICLP.2011.162,
  author =	{Fodor, Paul and Kifer, Michael},
  title =	{{Transaction Logic with Defaults and Argumentation Theories}},
  booktitle =	{Technical Communications of the 27th International Conference on Logic Programming (ICLP'11)},
  pages =	{162--174},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-939897-31-6},
  ISSN =	{1868-8969},
  year =	{2011},
  volume =	{11},
  editor =	{Gallagher, John P. and Gelfond, Michael},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICLP.2011.162},
  URN =		{urn:nbn:de:0030-drops-31594},
  doi =		{10.4230/LIPIcs.ICLP.2011.162},
  annote =	{Keywords: Transaction Logic, Defeasible reasoning, Well-founded models}
}
Document
DOI: 10.4230/LIPIcs.ICLP.2011.175
Multi-agent Confidential Abductive Reasoning

Authors: Jiefei Ma, Alessandra Russo, Krysia Broda, and Emil Lupu

Abstract
In the context of multi-agent hypothetical reasoning, agents typically have partial knowledge about their environments, and the union of such knowledge is still incomplete to represent the whole world. Thus, given a global query they collaborate with each other to make correct inferences and hypothesis, whilst maintaining global constraints. Most collaborative reasoning systems operate on the assumption that agents can share or communicate any information they have. However, in application domains like multi-agent systems for healthcare or distributed software agents for security policies in coalition networks, confidentiality of knowledge is an additional primary concern. These agents are required to collaborately compute consistent answers for a query whilst preserving their own private information. This paper addresses this issue showing how this dichotomy between "open communication" in collaborative reasoning and protection of confidentiality can be accommodated. We present a general-purpose distributed abductive logic programming system for multi-agent hypothetical reasoning with confidentiality. Specifically, the system computes consistent conditional answers for a query over a set of distributed normal logic programs with possibly unbound domains and arithmetic constraints, preserving the private information within the logic programs. A case study on security policy analysis in distributed coalition networks is described, as an example of many applications of this system.
Cite as

Jiefei Ma, Alessandra Russo, Krysia Broda, and Emil Lupu. Multi-agent Confidential Abductive Reasoning. In Technical Communications of the 27th International Conference on Logic Programming (ICLP'11). Leibniz International Proceedings in Informatics (LIPIcs), Volume 11, pp. 175-186, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2011)

Copy BibTex To Clipboard

@InProceedings{ma_et_al:LIPIcs.ICLP.2011.175,
  author =	{Ma, Jiefei and Russo, Alessandra and Broda, Krysia and Lupu, Emil},
  title =	{{Multi-agent Confidential Abductive Reasoning}},
  booktitle =	{Technical Communications of the 27th International Conference on Logic Programming (ICLP'11)},
  pages =	{175--186},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-939897-31-6},
  ISSN =	{1868-8969},
  year =	{2011},
  volume =	{11},
  editor =	{Gallagher, John P. and Gelfond, Michael},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICLP.2011.175},
  URN =		{urn:nbn:de:0030-drops-31736},
  doi =		{10.4230/LIPIcs.ICLP.2011.175},
  annote =	{Keywords: Abductive Logic Programming, Coordination, Agents}
}
Document
DOI: 10.4230/LIPIcs.ICLP.2011.187
BAAC: A Prolog System for Action Description and Agents Coordination

Authors: Agostino Dovier, Andrea Formisano, and Enrico Pontelli

Abstract
The paper presents a system for knowledge representation and coordination, where autonomous agents reason and act in a shared environment. Agents autonomously pursue individual goals, but can interact through a shared knowledge repository. In their interactions, agents deal with problems of synchronization and concurrency, and have to realize coordination by developing proper strategies in order to ensure a consistent global execution of their autonomously derived plans. This kind of knowledge is modeled using an extension of the action description language B. A distributed planning problem is formalized by providing a number of declarative specifications of the portion of the problem pertaining a single agent. Each of these specifications is executable by a stand-alone CLP-based planner. The coordination platform, implemented in Prolog, is easily modifiable and extensible. New user-defined interaction protocols can be integrated.
Cite as

Agostino Dovier, Andrea Formisano, and Enrico Pontelli. BAAC: A Prolog System for Action Description and Agents Coordination. In Technical Communications of the 27th International Conference on Logic Programming (ICLP'11). Leibniz International Proceedings in Informatics (LIPIcs), Volume 11, pp. 187-197, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2011)

Copy BibTex To Clipboard

@InProceedings{dovier_et_al:LIPIcs.ICLP.2011.187,
  author =	{Dovier, Agostino and Formisano, Andrea and Pontelli, Enrico},
  title =	{{BAAC: A Prolog System for Action Description and Agents Coordination}},
  booktitle =	{Technical Communications of the 27th International Conference on Logic Programming (ICLP'11)},
  pages =	{187--197},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-939897-31-6},
  ISSN =	{1868-8969},
  year =	{2011},
  volume =	{11},
  editor =	{Gallagher, John P. and Gelfond, Michael},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICLP.2011.187},
  URN =		{urn:nbn:de:0030-drops-31600},
  doi =		{10.4230/LIPIcs.ICLP.2011.187},
  annote =	{Keywords: Knowledge Representation, Multi-Agent Systems, Planning, CLP}
}
Document
DOI: 10.4230/LIPIcs.ICLP.2011.198
Declarative Processing of Semistructured Web Data

Authors: Michael Hanus

Abstract
In order to give application programs access to data stored in the web in semistructured formats, in particular, in XML format, we propose a domain-specific language (DSL) for declarative processing such data. Our language is embedded in the functional logic programming language Curry and offers powerful matching constructs that enable a declarative description of accessing and transforming XML data. We exploit advanced features of functional logic programming to provide a high-level and maintainable implementation of our language. Actually, this paper contains the complete code of our implementation so that the source text of this paper is an executable implementation of our embedded DSL.
Cite as

Michael Hanus. Declarative Processing of Semistructured Web Data. In Technical Communications of the 27th International Conference on Logic Programming (ICLP'11). Leibniz International Proceedings in Informatics (LIPIcs), Volume 11, pp. 198-208, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2011)

Copy BibTex To Clipboard

@InProceedings{hanus:LIPIcs.ICLP.2011.198,
  author =	{Hanus, Michael},
  title =	{{Declarative Processing of Semistructured Web Data}},
  booktitle =	{Technical Communications of the 27th International Conference on Logic Programming (ICLP'11)},
  pages =	{198--208},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-939897-31-6},
  ISSN =	{1868-8969},
  year =	{2011},
  volume =	{11},
  editor =	{Gallagher, John P. and Gelfond, Michael},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICLP.2011.198},
  URN =		{urn:nbn:de:0030-drops-31629},
  doi =		{10.4230/LIPIcs.ICLP.2011.198},
  annote =	{Keywords: functional logic programming, domain specific languages, XML}
}
Document
DOI: 10.4230/LIPIcs.ICLP.2011.209
CDAOStore: A Phylogenetic Repository Using Logic Programming and Web Services

Authors: Brandon Chisham, Enrico Pontelli, Tran Cao Son, and Ben Wright

Abstract
The CDAOStore is a portal aimed at facilitating the storage and retrieval of data and metadata associated to studies in the field of evolutionary biology and phylogenetic analysis. The novelty of CDAOStore lies in the use of a semantic-based approach to the storage and querying of data. This enables CDAOStore to overcome the data format restrictions and complexities of other repositories (e.g., TreeBase) and to provide a domain-specific query interface, derived from studies of querying requirements for phylogenetic databases. CDAOStore represents the first full implementation of the EvoIO stack, an inter-operation stack composed of a formal ontology (the Comparative Data Analysis Ontology), an XML exchange format (NeXML), and a web services API (PhyloWS). CDAOStore has been implemented on top of an RDF triple store, using a combination of standard web technologies and logic programming technology. In particular, we employed Prolog to support some of the format transformation tasks and, more importantly, in the implementation of several of the domain-specific queries, whose structure is beyond the reach of standard RDF query languages (e.g., SPARQL). CDAOStore is operational and it already hosts over 90 million RDF triples, imported from TreeBase or submitted by other domain scientists.
Cite as

Brandon Chisham, Enrico Pontelli, Tran Cao Son, and Ben Wright. CDAOStore: A Phylogenetic Repository Using Logic Programming and Web Services. In Technical Communications of the 27th International Conference on Logic Programming (ICLP'11). Leibniz International Proceedings in Informatics (LIPIcs), Volume 11, pp. 209-219, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2011)

Copy BibTex To Clipboard

@InProceedings{chisham_et_al:LIPIcs.ICLP.2011.209,
  author =	{Chisham, Brandon and Pontelli, Enrico and Son, Tran  Cao and Wright, Ben},
  title =	{{CDAOStore: A Phylogenetic Repository Using Logic Programming and Web Services}},
  booktitle =	{Technical Communications of the 27th International Conference on Logic Programming (ICLP'11)},
  pages =	{209--219},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-939897-31-6},
  ISSN =	{1868-8969},
  year =	{2011},
  volume =	{11},
  editor =	{Gallagher, John P. and Gelfond, Michael},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICLP.2011.209},
  URN =		{urn:nbn:de:0030-drops-31635},
  doi =		{10.4230/LIPIcs.ICLP.2011.209},
  annote =	{Keywords: Bioinformatics, Phylogenetic Analysis, Prolog, Ontologies}
}
Document
DOI: 10.4230/LIPIcs.ICLP.2011.220
Bayesian Annotation Networks for Complex Sequence Analysis

Authors: Henning Christiansen, Christian Theil Have, Ole Torp Lassen, and Matthieu Petit

Abstract
Probabilistic models that associate annotations to sequential data are widely used in computational biology and a range of other applications. Models integrating with logic programs provide, furthermore, for sophistication and generality, at the cost of potentially very high computational complexity. A methodology is proposed for modularization of such models into sub-models, each representing a particular interpretation of the input data to be analysed. Their composition forms, in a natural way, a Bayesian network, and we show how standard methods for prediction and training can be adapted for such composite models in an iterative way, obtaining reasonable complexity results. Our methodology can be implemented using the probabilistic-logic PRISM system, developed by Sato et al, in a way that allows for practical applications.
Cite as

Henning Christiansen, Christian Theil Have, Ole Torp Lassen, and Matthieu Petit. Bayesian Annotation Networks for Complex Sequence Analysis. In Technical Communications of the 27th International Conference on Logic Programming (ICLP'11). Leibniz International Proceedings in Informatics (LIPIcs), Volume 11, pp. 220-230, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2011)

Copy BibTex To Clipboard

@InProceedings{christiansen_et_al:LIPIcs.ICLP.2011.220,
  author =	{Christiansen, Henning and Theil Have, Christian and Torp Lassen, Ole and Petit, Matthieu},
  title =	{{Bayesian Annotation Networks for Complex Sequence Analysis}},
  booktitle =	{Technical Communications of the 27th International Conference on Logic Programming (ICLP'11)},
  pages =	{220--230},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-939897-31-6},
  ISSN =	{1868-8969},
  year =	{2011},
  volume =	{11},
  editor =	{Gallagher, John P. and Gelfond, Michael},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICLP.2011.220},
  URN =		{urn:nbn:de:0030-drops-31649},
  doi =		{10.4230/LIPIcs.ICLP.2011.220},
  annote =	{Keywords: Probabilistic Logic Bayesian Sequence Analysis}
}
Document
DOI: 10.4230/LIPIcs.ICLP.2011.231
Improving the Outcome of a Probabilistic Logic Music System Generator by Using Perlin Noise

Authors: Colin J. Nicholson, Danny De Schreye, and Jon Sneyers

Abstract
APOPCALEAPS is a logic-based music generation program that uses high level probabilistic rules. The music produced by APOPCALEAPS is controlled by parameters that can be customized by a user to create personalized songs. Perlin noise is a type of gradient noise algorithm which generates smooth and controllable variations of random numbers. This paper introduces the idea of using a Perlin noise algorithm on songs produced by APOPCALEAPS to alter their melody. The noise system modifies the song’s melody with noise values that fluctuate as measures change in a song. Songs with more notes and more elaborate differences between the notes are modified by the system more than simpler songs. The output of the system is a different but similar song. This research can be used for generation of music with structure where one would need to generate variants on a theme.
Cite as

Colin J. Nicholson, Danny De Schreye, and Jon Sneyers. Improving the Outcome of a Probabilistic Logic Music System Generator by Using Perlin Noise. In Technical Communications of the 27th International Conference on Logic Programming (ICLP'11). Leibniz International Proceedings in Informatics (LIPIcs), Volume 11, pp. 231-239, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2011)

Copy BibTex To Clipboard

@InProceedings{nicholson_et_al:LIPIcs.ICLP.2011.231,
  author =	{Nicholson, Colin J. and De Schreye, Danny and Sneyers, Jon},
  title =	{{Improving the Outcome of a Probabilistic Logic Music System Generator by Using Perlin Noise}},
  booktitle =	{Technical Communications of the 27th International Conference on Logic Programming (ICLP'11)},
  pages =	{231--239},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-939897-31-6},
  ISSN =	{1868-8969},
  year =	{2011},
  volume =	{11},
  editor =	{Gallagher, John P. and Gelfond, Michael},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICLP.2011.231},
  URN =		{urn:nbn:de:0030-drops-31651},
  doi =		{10.4230/LIPIcs.ICLP.2011.231},
  annote =	{Keywords: Probabilistic logic, Music generation, Perlin noise}
}
Document
DOI: 10.4230/LIPIcs.ICLP.2011.240
Abduction in Annotated Probabilistic Temporal Logic

Authors: Cristian Molinaro, Amy Sliva, and V. S. Subrahmanian

Abstract
Annotated Probabilistic Temporal (APT) logic programs are a form of logic programs that allow users to state (or systems to automatically learn)rules of the form ``formula G becomes true K time units after formula F became true with L to U% probability.'' In this paper, we develop a theory of abduction for APT logic programs. Specifically, given an APT logic program Pi, a set of formulas H that can be ``added'' to Pi, and a goal G, is there a subset S of H such that Pi \cup S is consistent and entails the goal G? In this paper, we study the complexity of the Basic APT Abduction Problem (BAAP). We then leverage a geometric characterization of BAAP to suggest a set of pruning strategies when solving BAAP and use these intuitions to develop a sound and complete algorithm.
Cite as

Cristian Molinaro, Amy Sliva, and V. S. Subrahmanian. Abduction in Annotated Probabilistic Temporal Logic. In Technical Communications of the 27th International Conference on Logic Programming (ICLP'11). Leibniz International Proceedings in Informatics (LIPIcs), Volume 11, pp. 240-250, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2011)

Copy BibTex To Clipboard

@InProceedings{molinaro_et_al:LIPIcs.ICLP.2011.240,
  author =	{Molinaro, Cristian and Sliva, Amy and Subrahmanian, V. S.},
  title =	{{Abduction in Annotated Probabilistic Temporal Logic}},
  booktitle =	{Technical Communications of the 27th International Conference on Logic Programming (ICLP'11)},
  pages =	{240--250},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-939897-31-6},
  ISSN =	{1868-8969},
  year =	{2011},
  volume =	{11},
  editor =	{Gallagher, John P. and Gelfond, Michael},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICLP.2011.240},
  URN =		{urn:nbn:de:0030-drops-31697},
  doi =		{10.4230/LIPIcs.ICLP.2011.240},
  annote =	{Keywords: Probabilistic Reasoning, Imprecise Probabilities, Temporal Reasoning, Abductive Reasoning}
}
Document
DOI: 10.4230/LIPIcs.ICLP.2011.251
Automatic Parallelism in Mercury

Authors: Paul Bone

Abstract
Our project is concerned with the automatic parallelization of Mercury programs. Mercury is a purely-declarative logic programming language, this makes it easy to determine whether a set of computations may be performed in parallel with one-anther. However, the problem of how to determine which computations should be executed in parallel in order to make the program perform optimally is unsolved. Therefore, our work concentrates on building a profiler-feedback automatic parallelization system for Mercury that creates programs with very good parallel performance with as little help from the programmer as possible.
Cite as

Paul Bone. Automatic Parallelism in Mercury. In Technical Communications of the 27th International Conference on Logic Programming (ICLP'11). Leibniz International Proceedings in Informatics (LIPIcs), Volume 11, pp. 251-254, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2011)

Copy BibTex To Clipboard

@InProceedings{bone:LIPIcs.ICLP.2011.251,
  author =	{Bone, Paul},
  title =	{{Automatic Parallelism in Mercury}},
  booktitle =	{Technical Communications of the 27th International Conference on Logic Programming (ICLP'11)},
  pages =	{251--254},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-939897-31-6},
  ISSN =	{1868-8969},
  year =	{2011},
  volume =	{11},
  editor =	{Gallagher, John P. and Gelfond, Michael},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICLP.2011.251},
  URN =		{urn:nbn:de:0030-drops-31828},
  doi =		{10.4230/LIPIcs.ICLP.2011.251},
  annote =	{Keywords: Program Optimization, Automatic Parallelism, Mercury}
}
Document
DOI: 10.4230/LIPIcs.ICLP.2011.255
Consistency Techniques for Hybrid Simulations

Authors: Marco Bottalico

Abstract
The goal of this paper is to show consistency techniques methods and hybrid stochastic/deterministic models to describe biochemical systems and their behaviour through the ordinary differential equations.
Cite as

Marco Bottalico. Consistency Techniques for Hybrid Simulations. In Technical Communications of the 27th International Conference on Logic Programming (ICLP'11). Leibniz International Proceedings in Informatics (LIPIcs), Volume 11, pp. 255-260, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2011)

Copy BibTex To Clipboard

@InProceedings{bottalico:LIPIcs.ICLP.2011.255,
  author =	{Bottalico, Marco},
  title =	{{Consistency Techniques for Hybrid Simulations}},
  booktitle =	{Technical Communications of the 27th International Conference on Logic Programming (ICLP'11)},
  pages =	{255--260},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-939897-31-6},
  ISSN =	{1868-8969},
  year =	{2011},
  volume =	{11},
  editor =	{Gallagher, John P. and Gelfond, Michael},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICLP.2011.255},
  URN =		{urn:nbn:de:0030-drops-31837},
  doi =		{10.4230/LIPIcs.ICLP.2011.255},
  annote =	{Keywords: Consistency techniques, deterministic approach, stochastic approach}
}
Document
DOI: 10.4230/LIPIcs.ICLP.2011.261
Extensions of Answer Set Programming

Authors: Alex Brik

Abstract
This paper describes a doctoral research in three areas: Hybrid ASP - an extension of Answer Set Programming for reasoning about dynamical systems, an extension of Set Constraint atoms for reasoning about preferences, computing stable models of logic programs using Metropolis type algorithms. The paper discusses a possible application of all three areas to the problem of maximizing total expected reward.
Cite as

Alex Brik. Extensions of Answer Set Programming. In Technical Communications of the 27th International Conference on Logic Programming (ICLP'11). Leibniz International Proceedings in Informatics (LIPIcs), Volume 11, pp. 261-267, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2011)

Copy BibTex To Clipboard

@InProceedings{brik:LIPIcs.ICLP.2011.261,
  author =	{Brik, Alex},
  title =	{{Extensions of Answer Set Programming}},
  booktitle =	{Technical Communications of the 27th International Conference on Logic Programming (ICLP'11)},
  pages =	{261--267},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-939897-31-6},
  ISSN =	{1868-8969},
  year =	{2011},
  volume =	{11},
  editor =	{Gallagher, John P. and Gelfond, Michael},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICLP.2011.261},
  URN =		{urn:nbn:de:0030-drops-31846},
  doi =		{10.4230/LIPIcs.ICLP.2011.261},
  annote =	{Keywords: Answer set programming}
}
Document
DOI: 10.4230/LIPIcs.ICLP.2011.268
A Semiring-based framework for fair resources allocation

Authors: Paola Campli

Abstract
In this paper a general framework (based on soft constraints) to model and solve the fair allocation problem is proposed. Our formal approach allows to model different allocation problems, ranging from goods and resources allocation to task and chore division. Soft constraints are employed to find a fair solution by respecting the agent’s preferences; indeed these can be modeled in a natural fashion by using the Semiring-based framework for soft constraints. The fairness property is considered following an economical point of view, that is, taking into account the notions of envy-freeness (each player likes its allocation at least as much as those that the other players receive, so it does not envy anybody else) and efficiency (there is no other division better for everybody, or better for some players and not worse for the others).
Cite as

Paola Campli. A Semiring-based framework for fair resources allocation. In Technical Communications of the 27th International Conference on Logic Programming (ICLP'11). Leibniz International Proceedings in Informatics (LIPIcs), Volume 11, pp. 268-273, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2011)

Copy BibTex To Clipboard

@InProceedings{campli:LIPIcs.ICLP.2011.268,
  author =	{Campli, Paola},
  title =	{{A Semiring-based framework for fair resources allocation}},
  booktitle =	{Technical Communications of the 27th International Conference on Logic Programming (ICLP'11)},
  pages =	{268--273},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-939897-31-6},
  ISSN =	{1868-8969},
  year =	{2011},
  volume =	{11},
  editor =	{Gallagher, John P. and Gelfond, Michael},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICLP.2011.268},
  URN =		{urn:nbn:de:0030-drops-31856},
  doi =		{10.4230/LIPIcs.ICLP.2011.268},
  annote =	{Keywords: soft constraints, fairness, allocation resources}
}
Document
DOI: 10.4230/LIPIcs.ICLP.2011.274
Promoting Modular Nonmonotonic Logic Programs

Authors: Thomas Krennwallner

Abstract
Modularity in Logic Programming has gained much attention over the past years. To date, many formalisms have been proposed that feature various aspects of modularity. In this paper, we present our current work on Modular Nonmonotonic Logic Programs (MLPs), which are logic programs under answer set semantics with modules that have contextualized input provided by other modules. Moreover, they allow for (mutually) recursive module calls. We pinpoint issues that are present in such cyclic module systems and highlight how MLPs addresses them.
Cite as

Thomas Krennwallner. Promoting Modular Nonmonotonic Logic Programs. In Technical Communications of the 27th International Conference on Logic Programming (ICLP'11). Leibniz International Proceedings in Informatics (LIPIcs), Volume 11, pp. 274-279, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2011)

Copy BibTex To Clipboard

@InProceedings{krennwallner:LIPIcs.ICLP.2011.274,
  author =	{Krennwallner, Thomas},
  title =	{{Promoting Modular Nonmonotonic Logic Programs}},
  booktitle =	{Technical Communications of the 27th International Conference on Logic Programming (ICLP'11)},
  pages =	{274--279},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-939897-31-6},
  ISSN =	{1868-8969},
  year =	{2011},
  volume =	{11},
  editor =	{Gallagher, John P. and Gelfond, Michael},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICLP.2011.274},
  URN =		{urn:nbn:de:0030-drops-31860},
  doi =		{10.4230/LIPIcs.ICLP.2011.274},
  annote =	{Keywords: Knowledge Representation, Nonmonotonic Reasoning, Modular Logic Programming, Answer Set Programming}
}
Document
DOI: 10.4230/LIPIcs.ICLP.2011.280
Correct Reasoning about Logic Programs

Authors: Jael Kriener

Abstract
In this PhD project, we present an approach to the problem of determinacy inference in logic programs with cut, which treats cut uniformly and contextually. The overall aim is to develop a theoretical analysis, abstract it to a suitable domain and prove both the concrete analysis and the abstraction correct in a formal theorem prover (Coq). A crucial advantage of this approach, besides the guarantee of correctness, is the possibility of automatically extracting an implementation of the analysis.
Cite as

Jael Kriener. Correct Reasoning about Logic Programs. In Technical Communications of the 27th International Conference on Logic Programming (ICLP'11). Leibniz International Proceedings in Informatics (LIPIcs), Volume 11, pp. 280-283, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2011)

Copy BibTex To Clipboard

@InProceedings{kriener:LIPIcs.ICLP.2011.280,
  author =	{Kriener, Jael},
  title =	{{Correct Reasoning about Logic Programs}},
  booktitle =	{Technical Communications of the 27th International Conference on Logic Programming (ICLP'11)},
  pages =	{280--283},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-939897-31-6},
  ISSN =	{1868-8969},
  year =	{2011},
  volume =	{11},
  editor =	{Gallagher, John P. and Gelfond, Michael},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICLP.2011.280},
  URN =		{urn:nbn:de:0030-drops-31875},
  doi =		{10.4230/LIPIcs.ICLP.2011.280},
  annote =	{Keywords: Prolog, cut, determinacy inference, abstract interpretation, denotational semantics, automated theorem proving, Coq}
}
Document
DOI: 10.4230/LIPIcs.ICLP.2011.284
Accepting the natural order of rules in a logic program with preferences

Authors: Alexander Šimko

Abstract
Preference is a natural part of common sense reasoning. It allows us to select preferred conclusions from broader range of alternative conclusions. It is typically specified on parts of conclusions or on rules. Different semantics have been proposed that deal with preference on rules. None fully meets our requirements. We are interested in a descriptive approach to preference handling in logic programs under answer set semantics that always selects preferred answer set when standard one exists. Existing semantics that meet this criterion also give non intuitive conclusions on some programs. We think this kind of problem is related to the problem of not accepting natural order of rules induced by underlying answer set semantics. Our goal is to define semantics that would always select preferred answer set when standard one exists, accept natural order on rules, and satisfy principles for preference handling.
Cite as

Alexander Šimko. Accepting the natural order of rules in a logic program with preferences. In Technical Communications of the 27th International Conference on Logic Programming (ICLP'11). Leibniz International Proceedings in Informatics (LIPIcs), Volume 11, pp. 284-289, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2011)

Copy BibTex To Clipboard

@InProceedings{simko:LIPIcs.ICLP.2011.284,
  author =	{\v{S}imko, Alexander},
  title =	{{Accepting the natural order of rules in a logic program with preferences}},
  booktitle =	{Technical Communications of the 27th International Conference on Logic Programming (ICLP'11)},
  pages =	{284--289},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-939897-31-6},
  ISSN =	{1868-8969},
  year =	{2011},
  volume =	{11},
  editor =	{Gallagher, John P. and Gelfond, Michael},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICLP.2011.284},
  URN =		{urn:nbn:de:0030-drops-31885},
  doi =		{10.4230/LIPIcs.ICLP.2011.284},
  annote =	{Keywords: non-monotonicreasoning, knowledgerepresentation, answersetsemantics, preference handling, preferred answer set}
}
Document
DOI: 10.4230/LIPIcs.ICLP.2011.290
Implementation of Axiomatic Language

Authors: Walter W. Wilson

Abstract
This report summarizes a PhD research effort to implement a type of logic programming language called "axiomatic language". Axiomatic language is intended as a specification language, so its implementation involves the transformation of specifications to efficient algorithms. The language is described and the implementation task is discussed.
Cite as

Walter W. Wilson. Implementation of Axiomatic Language. In Technical Communications of the 27th International Conference on Logic Programming (ICLP'11). Leibniz International Proceedings in Informatics (LIPIcs), Volume 11, pp. 290-295, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2011)

Copy BibTex To Clipboard

@InProceedings{wilson:LIPIcs.ICLP.2011.290,
  author =	{Wilson, Walter W.},
  title =	{{Implementation of Axiomatic Language}},
  booktitle =	{Technical Communications of the 27th International Conference on Logic Programming (ICLP'11)},
  pages =	{290--295},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-939897-31-6},
  ISSN =	{1868-8969},
  year =	{2011},
  volume =	{11},
  editor =	{Gallagher, John P. and Gelfond, Michael},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICLP.2011.290},
  URN =		{urn:nbn:de:0030-drops-31893},
  doi =		{10.4230/LIPIcs.ICLP.2011.290},
  annote =	{Keywords: axiomatic language, specification, program transformation, unfold/fold}
}
Document
DOI: 10.4230/LIPIcs.ICLP.2011.296
Two Phase Description Logic Reasoning for Efficient Information Retrieval

Authors: Zsolt Zombori

Abstract
Description Logics are used more and more frequently for knowledge representation, creating an increasing demand for efficient automated DL reasoning. However, the existing implementations are inefficient in the presence of large amounts of data. This paper summarizes the results in transforming DL axioms to a set of function-free clauses of first-order logic which can be used for efficient, query oriented data reasoning. The described method has been implemented in a module of the DLog reasoner openly available on SourceForge to download.
Cite as

Zsolt Zombori. Two Phase Description Logic Reasoning for Efficient Information Retrieval. In Technical Communications of the 27th International Conference on Logic Programming (ICLP'11). Leibniz International Proceedings in Informatics (LIPIcs), Volume 11, pp. 296-300, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2011)

Copy BibTex To Clipboard

@InProceedings{zombori:LIPIcs.ICLP.2011.296,
  author =	{Zombori, Zsolt},
  title =	{{Two Phase Description Logic Reasoning for Efficient Information Retrieval}},
  booktitle =	{Technical Communications of the 27th International Conference on Logic Programming (ICLP'11)},
  pages =	{296--300},
  series =	{Leibniz International Proceedings in Informatics (LIPIcs)},
  ISBN =	{978-3-939897-31-6},
  ISSN =	{1868-8969},
  year =	{2011},
  volume =	{11},
  editor =	{Gallagher, John P. and Gelfond, Michael},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/LIPIcs.ICLP.2011.296},
  URN =		{urn:nbn:de:0030-drops-31906},
  doi =		{10.4230/LIPIcs.ICLP.2011.296},
  annote =	{Keywords: description logic, knowledge representation}
}

Filters

  • Authors
  • A
  • Alrajeh, Dalal
  • Antoniou, Grigoris
  • B
  • Bjørner, Nikolaj
  • Bochman, Alexander
  • Bone, Paul
  • Bottalico, Marco
  • Brand, Sebastian
  • Brass, Stefan
  • Brik, Alex
  • Broda, Krysia
  • Bulwahn, Lukas
  • C
  • Campli, Paola
  • Casolary, Michael
  • Chisham, Brandon
  • Christiansen, Henning
  • Csorba, János
  • D
  • De Koninck, Leslie
  • De Schreye, Danny
  • Dovier, Agostino
  • Drescher, Christian
  • E
  • Eichberg, Michael
  • F
  • Flouris, Giorgos
  • Fodor, Paul
  • Formisano, Andrea
  • G
  • Gallagher, John P.
  • Gebser, Martin
  • Gelfond, Michael
  • H
  • Hanus, Michael
  • Herranz, Ángel
  • J
  • Jackson, Ethan K.
  • K
  • Kaminski, Roland
  • Kaufmann, Benjamin
  • Kifer, Michael
  • Kramer, Jeff
  • Krennwallner, Thomas
  • Kriener, Jael
  • L
  • Lee, Joohyung
  • Lifschitz, Vladimir
  • Lupu, Emil
  • M
  • Ma, Jiefei
  • Mariño, Julio
  • Molinaro, Cristian
  • N
  • Nicholson, Colin J.
  • O
  • Ostrowski, Max
  • P
  • Petit, Matthieu
  • Pontelli, Enrico
  • R
  • Remmel, Jeffrey B.
  • Russo, Alessandra
  • S
  • Schaub, Torsten
  • Schulte, Wolfram
  • Šimko, Alexander
  • Sliva, Amy
  • Sneyers, Jon
  • Somogyi, Zoltan
  • Son, Tran Cao
  • Stuckey, Peter J.
  • Subrahmanian, V. S.
  • Szeredi, Péter
  • T
  • Theil Have, Christian
  • Torp Lassen, Ole
  • U
  • Uchitel, Sebastian
  • W
  • Walsh, Toby
  • Wang, Peter
  • Wilson, Walter W.
  • Wright, Ben
  • Z
  • Zombori, Zsolt

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
© 2023-2024 Schloss Dagstuhl – LZI GmbH Imprint Privacy Contact