36 Search Results for "Gelfond, Michael"

Volume

LIPIcs, Volume 11

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

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

Editors: John P. Gallagher and Michael Gelfond

Document
DOI: 10.4230/OASIcs.ICLP.2016.8
An Answer Set Programming Framework for Reasoning About Truthfulness of Statements by Agents

Authors: Tran Cao Son, Enrico Pontelli, Michael Gelfond, and Marcello Balduccini

Published in: OASIcs, Volume 52, Technical Communications of the 32nd International Conference on Logic Programming (ICLP 2016)

Abstract
We propose a framework for answering the question of whether statements made by an agent can be believed, in light of observations made over time. The basic components of the framework are a formalism for reasoning about actions, changes, and observations and a formalism for default reasoning. The framework is suitable for concrete implementation, e.g., using answer set programming for asserting the truthfulness of statements made by agents, starting from observations, knowledge about the actions of the agents, and a theory about the "normal" behavior of agents.
Cite as

Tran Cao Son, Enrico Pontelli, Michael Gelfond, and Marcello Balduccini. An Answer Set Programming Framework for Reasoning About Truthfulness of Statements by Agents. In Technical Communications of the 32nd International Conference on Logic Programming (ICLP 2016). Open Access Series in Informatics (OASIcs), Volume 52, pp. 8:1-8:4, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2016)

Copy BibTex To Clipboard

@InProceedings{caoson_et_al:OASIcs.ICLP.2016.8,
  author =	{Cao Son, Tran and Pontelli, Enrico and Gelfond, Michael and Balduccini, Marcello},
  title =	{{An Answer Set Programming Framework for Reasoning About Truthfulness of Statements by Agents}},
  booktitle =	{Technical Communications of the 32nd International Conference on Logic Programming (ICLP 2016)},
  pages =	{8:1--8:4},
  series =	{Open Access Series in Informatics (OASIcs)},
  ISBN =	{978-3-95977-007-1},
  ISSN =	{2190-6807},
  year =	{2016},
  volume =	{52},
  editor =	{Carro, Manuel and King, Andy and Saeedloei, Neda and De Vos, Marina},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/OASIcs.ICLP.2016.8},
  URN =		{urn:nbn:de:0030-drops-67383},
  doi =		{10.4230/OASIcs.ICLP.2016.8},
  annote =	{Keywords: Agents, ASP, Reasoning, Knowledge}
}
Document
Complete Volume
DOI: 10.4230/LIPIcs.ICLP.2011
LIPIcs, Volume 11, ICLP'11, Complete Volume

Authors: John P. Gallagher and Michael Gelfond

Published in: LIPIcs, Volume 11, Technical Communications of the 27th International Conference on Logic Programming (ICLP'11) (2011)

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

John P. Gallagher and Michael Gelfond. LIPIcs, Volume 11, ICLP'11, Complete Volume. In 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

Published in: LIPIcs, Volume 11, Technical Communications of the 27th International Conference on Logic Programming (ICLP'11) (2011)

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

John P. Gallagher and Michael Gelfond. Frontmatter, Table of Contents, Preface, Conference Organization. In 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

Published in: LIPIcs, Volume 11, Technical Communications of the 27th International Conference on Logic Programming (ICLP'11) (2011)

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

Published in: LIPIcs, Volume 11, Technical Communications of the 27th International Conference on Logic Programming (ICLP'11) (2011)

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

Published in: LIPIcs, Volume 11, Technical Communications of the 27th International Conference on Logic Programming (ICLP'11) (2011)

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

Published in: LIPIcs, Volume 11, Technical Communications of the 27th International Conference on Logic Programming (ICLP'11) (2011)

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

Published in: LIPIcs, Volume 11, Technical Communications of the 27th International Conference on Logic Programming (ICLP'11) (2011)

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

Published in: LIPIcs, Volume 11, Technical Communications of the 27th International Conference on Logic Programming (ICLP'11) (2011)

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

Published in: LIPIcs, Volume 11, Technical Communications of the 27th International Conference on Logic Programming (ICLP'11) (2011)

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

Published in: LIPIcs, Volume 11, Technical Communications of the 27th International Conference on Logic Programming (ICLP'11) (2011)

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

Published in: LIPIcs, Volume 11, Technical Communications of the 27th International Conference on Logic Programming (ICLP'11) (2011)

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

Published in: LIPIcs, Volume 11, Technical Communications of the 27th International Conference on Logic Programming (ICLP'11) (2011)

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

Published in: LIPIcs, Volume 11, Technical Communications of the 27th International Conference on Logic Programming (ICLP'11) (2011)

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}
}
  • Refine by Author
  • 3 Gelfond, Michael
  • 3 Pontelli, Enrico
  • 2 Brik, Alex
  • 2 Gallagher, John P.
  • 2 Russo, Alessandra
  • Show More...

  • Refine by Classification

  • Refine by Keyword
  • 3 Prolog
  • 3 answer set programming
  • 2 Agents
  • 2 Answer Set Programming
  • 2 Knowledge Representation
  • Show More...

  • Refine by Type
  • 35 document
  • 1 volume

  • Refine by Publication Year
  • 34 2011
  • 1 2013
  • 1 2016

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 Schloss Dagstuhl - LZI GmbH Imprint Privacy Contact