Volume
OASIcs, Volume 58
Technical Communications of the 33rd International Conference on Logic Programming (ICLP 2017)
-
Part of:
Series:
Open Access Series in Informatics (OASIcs)
Conference: International Conference on Logic Programming (ICLP)
Publication Details
- published at: 2018-02-14
- Publisher: Schloss Dagstuhl – Leibniz-Zentrum für Informatik
- ISBN: 978-3-95977-058-3
- DBLP: db/conf/iclp/iclp2017
Access Numbers
- Detailed Access Statistics available here
-
Total Document Accesses (updated on a weekly basis):
0PDF Downloads
Documents
No documents found matching your filter selection.
Document
Complete Volume
OASIcs, Volume 58, ICLP'17, Complete Volume
Abstract
OASIcs, Volume 58, ICLP'17, Complete Volume
Cite as
Technical Communications of the 33rd International Conference on Logic Programming (ICLP 2017). Open Access Series in Informatics (OASIcs), Volume 58, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2018)
Copy BibTex To Clipboard
@Proceedings{rocha_et_al:OASIcs.ICLP.2017,
title = {{OASIcs, Volume 58, ICLP'17, Complete Volume}},
booktitle = {Technical Communications of the 33rd International Conference on Logic Programming (ICLP 2017)},
series = {Open Access Series in Informatics (OASIcs)},
ISBN = {978-3-95977-058-3},
ISSN = {2190-6807},
year = {2018},
volume = {58},
editor = {Rocha, Ricardo and Son, Tran Cao and Mears, Christopher and Saeedloei, Neda},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/OASIcs.ICLP.2017},
URN = {urn:nbn:de:0030-drops-85407},
doi = {10.4230/OASIcs.ICLP.2017},
annote = {Keywords: Logic Programming, Software/Program Verification, Testing and Debugging, Programming Languages, Language Classifications}
}
Document
Front Matter
Front Matter, Table of Contents, Preface, Conference Organization
Abstract
Front Matter, Table of Contents, Preface, Conference Organization
Cite as
Technical Communications of the 33rd International Conference on Logic Programming (ICLP 2017). Open Access Series in Informatics (OASIcs), Volume 58, pp. 0:i-0:xii, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2018)
Copy BibTex To Clipboard
@InProceedings{rocha_et_al:OASIcs.ICLP.2017.0,
author = {Rocha, Ricardo and Son, Tran Cao and Mears, Christopher and Saeedloei, Neda},
title = {{Front Matter, Table of Contents, Preface, Conference Organization}},
booktitle = {Technical Communications of the 33rd International Conference on Logic Programming (ICLP 2017)},
pages = {0:i--0:xii},
series = {Open Access Series in Informatics (OASIcs)},
ISBN = {978-3-95977-058-3},
ISSN = {2190-6807},
year = {2018},
volume = {58},
editor = {Rocha, Ricardo and Son, Tran Cao and Mears, Christopher and Saeedloei, Neda},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/OASIcs.ICLP.2017.0},
URN = {urn:nbn:de:0030-drops-84525},
doi = {10.4230/OASIcs.ICLP.2017.0},
annote = {Keywords: Front Matter, Table of Contents, Preface, Conference Organization}
}
Document
Entity set expansion from the Web via ASP
Abstract
Knowledge on the Web in a large part is stored in various semantic resources that formalize, represent and organize it differently.
Combining information from several sources can improve results of tasks such as recognizing similarities among objects.
In this paper, we propose a logic-based method for the problem of entity set expansion (ESE), i.e. extending a list of named entities given a set of seeds.
This problem has relevant applications in the Information Extraction domain, specifically in automatic lexicon generation for dictionary-based annotating tools.
Contrary to typical approaches in natural languages processing, based on co-occurrence statistics of words, we determine the common category of the seeds by analyzing the semantic relations of the objects the words represent.
To do it, we integrate information from selected Web resources.
We introduce a notion of an entity network that uniformly represents the combined knowledge and allow to reason over it.
We show how to use the network to disambiguate word senses by relying on a concept of optimal common ancestor
and how to discover similarities between two entities.
Finally, we show how to expand a set of entities,
by using answer set programming with external predicates.
Cite as
Weronika T. Adrian, Marco Manna, Nicola Leone, Giovanni Amendola, and Marek Adrian. Entity set expansion from the Web via ASP. In Technical Communications of the 33rd International Conference on Logic Programming (ICLP 2017). Open Access Series in Informatics (OASIcs), Volume 58, pp. 1:1-1:5, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2018)
Copy BibTex To Clipboard
@InProceedings{adrian_et_al:OASIcs.ICLP.2017.1,
author = {Adrian, Weronika T. and Manna, Marco and Leone, Nicola and Amendola, Giovanni and Adrian, Marek},
title = {{Entity set expansion from the Web via ASP}},
booktitle = {Technical Communications of the 33rd International Conference on Logic Programming (ICLP 2017)},
pages = {1:1--1:5},
series = {Open Access Series in Informatics (OASIcs)},
ISBN = {978-3-95977-058-3},
ISSN = {2190-6807},
year = {2018},
volume = {58},
editor = {Rocha, Ricardo and Son, Tran Cao and Mears, Christopher and Saeedloei, Neda},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/OASIcs.ICLP.2017.1},
URN = {urn:nbn:de:0030-drops-84629},
doi = {10.4230/OASIcs.ICLP.2017.1},
annote = {Keywords: answer set programming, entity set expansion, information extraction, natural language processing, word sense disambiguation}
}
Document
The Pyglaf Argumentation Reasoner
Abstract
The pyglaf reasoner takes advantage of circumscription to solve computational problems of abstract argumentation frameworks.
In fact, many of these problems are reduced to circumscription by means of linear encodings, and a few others are solved by means of a sequence of calls to an oracle for circumscription.
Within pyglaf, Python is used to build the encodings and to control the execution of the external circumscription solver, which extends the SAT solver glucose and implements an algorithm based on unsatisfiable core analysis.
Cite as
Mario Alviano. The Pyglaf Argumentation Reasoner. In Technical Communications of the 33rd International Conference on Logic Programming (ICLP 2017). Open Access Series in Informatics (OASIcs), Volume 58, pp. 2:1-2:3, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2018)
Copy BibTex To Clipboard
@InProceedings{alviano:OASIcs.ICLP.2017.2,
author = {Alviano, Mario},
title = {{The Pyglaf Argumentation Reasoner}},
booktitle = {Technical Communications of the 33rd International Conference on Logic Programming (ICLP 2017)},
pages = {2:1--2:3},
series = {Open Access Series in Informatics (OASIcs)},
ISBN = {978-3-95977-058-3},
ISSN = {2190-6807},
year = {2018},
volume = {58},
editor = {Rocha, Ricardo and Son, Tran Cao and Mears, Christopher and Saeedloei, Neda},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/OASIcs.ICLP.2017.2},
URN = {urn:nbn:de:0030-drops-84546},
doi = {10.4230/OASIcs.ICLP.2017.2},
annote = {Keywords: abstract argumentation frameworks, propositional circumscription, minimal model enumeration, incremental solving}
}
Document
Reasoning on anonymity in Datalog+/-
Abstract
In this paper we empower the ontology-based query answering framework with the ability to reason on the properties of “known” (non-anonymous) and anonymous individuals. To this end, we extend Datalog+/- with epistemic variables that range over “known” individuals only. The resulting framework, called datalog^{\exists,K}, offers good and novel knowledge representation capabilities, allowing for reasoning even on the anonymity of individuals. To guarantee effective computability, we define shyK, a decidable subclass of datalog^{\exists,K}, that fully generalizes (plain) Datalog, enhancing its knowledge modeling features without any computational overhead: OBQA for shyK keeps exactly the same (data and combined) complexity as for Datalog. To measure the expressiveness of shyK, we borrow the notion of uniform equivalence from answer set programming, and show that shyK is strictly more expressive than the DL ELH. Interestingly, shyK keeps a lower complexity, compared to other Datalog+/- languages that can express this DL.
Cite as
Giovanni Amendola, Nicola Leone, Marco Manna, and Pierfrancesco Veltri. Reasoning on anonymity in Datalog+/-. In Technical Communications of the 33rd International Conference on Logic Programming (ICLP 2017). Open Access Series in Informatics (OASIcs), Volume 58, pp. 3:1-3:5, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2018)
Copy BibTex To Clipboard
@InProceedings{amendola_et_al:OASIcs.ICLP.2017.3,
author = {Amendola, Giovanni and Leone, Nicola and Manna, Marco and Veltri, Pierfrancesco},
title = {{Reasoning on anonymity in Datalog+/-}},
booktitle = {Technical Communications of the 33rd International Conference on Logic Programming (ICLP 2017)},
pages = {3:1--3:5},
series = {Open Access Series in Informatics (OASIcs)},
ISBN = {978-3-95977-058-3},
ISSN = {2190-6807},
year = {2018},
volume = {58},
editor = {Rocha, Ricardo and Son, Tran Cao and Mears, Christopher and Saeedloei, Neda},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/OASIcs.ICLP.2017.3},
URN = {urn:nbn:de:0030-drops-84587},
doi = {10.4230/OASIcs.ICLP.2017.3},
annote = {Keywords: Datalog, query answering, Datalog+/-, ontologies, expressiveness}
}
Document
Rule Based Temporal Inference
Abstract
Time-wise knowledge is relevant in knowledge graphs as the majority facts are true in some time period, for instance, (Barack Obama, president of, USA, 2009, 2017). Consequently, temporal information extraction and
temporal scoping of facts in knowledge graphs have been a focus of recent research. Due to this, a number of temporal knowledge graphs have become available such as YAGO and Wikidata. In addition, since the temporal facts are obtained from open text, they can be weighted, i.e., the extraction tools assign each fact with a confidence score indicating how likely that fact is to be true. Temporal facts coupled with confidence scores result in a probabilistic temporal knowledge graph. In such a graph, probabilistic query evaluation (marginal inference) and computing most probable explanations (MPE inference) are fundamental problems. In addition, in these problems temporal coalescing, an important research in temporal databases, is very challenging. In this work, we study these problems by using probabilistic programming. We report experimental results comparing the efficiency of several state of the art systems.
Cite as
Melisachew Wudage Chekol and Heiner Stuckenschmidt. Rule Based Temporal Inference. In Technical Communications of the 33rd International Conference on Logic Programming (ICLP 2017). Open Access Series in Informatics (OASIcs), Volume 58, pp. 4:1-4:14, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2018)
Copy BibTex To Clipboard
@InProceedings{chekol_et_al:OASIcs.ICLP.2017.4,
author = {Chekol, Melisachew Wudage and Stuckenschmidt, Heiner},
title = {{Rule Based Temporal Inference}},
booktitle = {Technical Communications of the 33rd International Conference on Logic Programming (ICLP 2017)},
pages = {4:1--4:14},
series = {Open Access Series in Informatics (OASIcs)},
ISBN = {978-3-95977-058-3},
ISSN = {2190-6807},
year = {2018},
volume = {58},
editor = {Rocha, Ricardo and Son, Tran Cao and Mears, Christopher and Saeedloei, Neda},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/OASIcs.ICLP.2017.4},
URN = {urn:nbn:de:0030-drops-84612},
doi = {10.4230/OASIcs.ICLP.2017.4},
annote = {Keywords: temporal inference, temporal knowledge graphs, probabilistic temporal reasoning}
}
Document
Tool Description
Logic Programming with Max-Clique and its Application to Graph Coloring (Tool Description)
Abstract
This paper presents pl-cliquer, a Prolog interface to the
cliquer tool for the maximum clique problem.
Using pl-cliquer facilitates a programming style that allows logic programs to integrate with other tools such as: Boolean
satisfiability solvers, finite domain constraint solvers, and graph isomorphism tools.
We illustrate this programming style to solve the Graph Coloring problem, applying a symmetry break that derives from finding a maximum clique in the input graph.
We present an experimentation of the resulting Graph Coloring solver on two benchmarks, one from the graph coloring community and the other from the examination timetabling community.
The implementation of pl-cliquer consists of two components: A lightweight C interface, connecting cliquer's C library and
Prolog, and a Prolog module which loads the library.
The complete tool is available as a SWI-Prolog module.
Cite as
Michael Codish, Michael Frank, Amit Metodi, and Morad Muslimany. Logic Programming with Max-Clique and its Application to Graph Coloring (Tool Description). In Technical Communications of the 33rd International Conference on Logic Programming (ICLP 2017). Open Access Series in Informatics (OASIcs), Volume 58, pp. 5:1-5:18, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2018)
Copy BibTex To Clipboard
@InProceedings{codish_et_al:OASIcs.ICLP.2017.5,
author = {Codish, Michael and Frank, Michael and Metodi, Amit and Muslimany, Morad},
title = {{Logic Programming with Max-Clique and its Application to Graph Coloring}},
booktitle = {Technical Communications of the 33rd International Conference on Logic Programming (ICLP 2017)},
pages = {5:1--5:18},
series = {Open Access Series in Informatics (OASIcs)},
ISBN = {978-3-95977-058-3},
ISSN = {2190-6807},
year = {2018},
volume = {58},
editor = {Rocha, Ricardo and Son, Tran Cao and Mears, Christopher and Saeedloei, Neda},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/OASIcs.ICLP.2017.5},
URN = {urn:nbn:de:0030-drops-84559},
doi = {10.4230/OASIcs.ICLP.2017.5},
annote = {Keywords: Logic Programming, Constraints, Maximum Clique}
}
Document
Semantic Versioning Checking in a Declarative Package Manager
Abstract
Semantic versioning is a principle to associate version numbers to
different software releases in a meaningful manner. The correct use
of version numbers is important in software package systems where
packages depend on other packages with specific releases. When
patch or minor version numbers are incremented, the API is unchanged
or extended, respectively, but the semantics of the operations
should not be affected (apart from bug fixes). Although many
software package management systems assumes this principle, they do
not check it or perform only simple syntactic signature checks. In
this paper we show that more substantive and fully automatic checks
are possible for declarative languages. We extend a package manager
for the functional logic language Curry with features to check the
semantic equivalence of two different versions of a software
package. For this purpose, we combine CurryCheck, a tool for
automated property testing, with program analysis techniques in
order to ensure the termination of the checker even in case of
possibly non-terminating operations defined in some package. As a
result, we obtain a software package manager which checks semantic
versioning and, thus, supports a reliable and also
specification-based development of software packages.
Cite as
Michael Hanus. Semantic Versioning Checking in a Declarative Package Manager. In Technical Communications of the 33rd International Conference on Logic Programming (ICLP 2017). Open Access Series in Informatics (OASIcs), Volume 58, pp. 6:1-6:16, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2018)
Copy BibTex To Clipboard
@InProceedings{hanus:OASIcs.ICLP.2017.6,
author = {Hanus, Michael},
title = {{Semantic Versioning Checking in a Declarative Package Manager}},
booktitle = {Technical Communications of the 33rd International Conference on Logic Programming (ICLP 2017)},
pages = {6:1--6:16},
series = {Open Access Series in Informatics (OASIcs)},
ISBN = {978-3-95977-058-3},
ISSN = {2190-6807},
year = {2018},
volume = {58},
editor = {Rocha, Ricardo and Son, Tran Cao and Mears, Christopher and Saeedloei, Neda},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/OASIcs.ICLP.2017.6},
URN = {urn:nbn:de:0030-drops-84568},
doi = {10.4230/OASIcs.ICLP.2017.6},
annote = {Keywords: functional logic programming, semantic versioning, program testing}
}
Document
Understanding Restaurant Stories Using an ASP Theory of Intentions
Abstract
The paper describes an application of logic programming to story understanding. Substantial work in this direction has been done by Erik Mueller, who focused on texts about stereotypical activities (or scripts), in particular restaurant stories. His system performed well, but could not understand texts describing exceptional scenarios. We propose addressing this problem by using a theory of intentions developed by Blount, Gelfond, and Balduccini. We present a methodology in which we model scripts as activities and employ the concept of an intentional agent to reason about both normal and exceptional scenarios.
Cite as
Daniela Inclezan, Qinglin Zhang, Marcello Balduccini, and Ankush Israney. Understanding Restaurant Stories Using an ASP Theory of Intentions. In Technical Communications of the 33rd International Conference on Logic Programming (ICLP 2017). Open Access Series in Informatics (OASIcs), Volume 58, pp. 7:1-7:4, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2018)
Copy BibTex To Clipboard
@InProceedings{inclezan_et_al:OASIcs.ICLP.2017.7,
author = {Inclezan, Daniela and Zhang, Qinglin and Balduccini, Marcello and Israney, Ankush},
title = {{Understanding Restaurant Stories Using an ASP Theory of Intentions}},
booktitle = {Technical Communications of the 33rd International Conference on Logic Programming (ICLP 2017)},
pages = {7:1--7:4},
series = {Open Access Series in Informatics (OASIcs)},
ISBN = {978-3-95977-058-3},
ISSN = {2190-6807},
year = {2018},
volume = {58},
editor = {Rocha, Ricardo and Son, Tran Cao and Mears, Christopher and Saeedloei, Neda},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/OASIcs.ICLP.2017.7},
URN = {urn:nbn:de:0030-drops-84638},
doi = {10.4230/OASIcs.ICLP.2017.7},
annote = {Keywords: answer set programming, story understanding, theory of intentions}
}
Document
Learning Effect Axioms via Probabilistic Logic Programming
Abstract
In this paper we showed how we can automatically learn the structure and parameters of probabilistic effect axioms for the Simple Event Calculus (SEC) from positive and negative example interpretations stated as short dialogue sequences in natural language. We used the cplint framework for this task that provides
libraries for structure and parameter learning and for answering queries with exact and inexact inference. The example dialogues that are used for learning the structure of the probabilistic logic program are parsed into dependency structures and then further translated into the Event Calculus notation with the help of a simple ontology. The novelty of our approach is that we can not only process uncertainty in event recognition but also learn the structure of effect axioms and combine these two sources of uncertainty to successfully answer queries under this probabilistic setting. Interestingly, our extension of the logic-based version of the SEC is completely elaboration-tolerant in the sense that the probabilistic version fully includes the logic-based version. This makes it possible to use the probabilistic version of the SEC in the traditional way as well as when we have to deal with uncertainty in the observed world. In the future, we would like to extend the probabilistic version of the SEC to deal -- among other things -- with concurrent actions and continuous change.
Cite as
Rolf Schwitter. Learning Effect Axioms via Probabilistic Logic Programming. In Technical Communications of the 33rd International Conference on Logic Programming (ICLP 2017). Open Access Series in Informatics (OASIcs), Volume 58, pp. 8:1-8:15, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2018)
Copy BibTex To Clipboard
@InProceedings{schwitter:OASIcs.ICLP.2017.8,
author = {Schwitter, Rolf},
title = {{Learning Effect Axioms via Probabilistic Logic Programming}},
booktitle = {Technical Communications of the 33rd International Conference on Logic Programming (ICLP 2017)},
pages = {8:1--8:15},
series = {Open Access Series in Informatics (OASIcs)},
ISBN = {978-3-95977-058-3},
ISSN = {2190-6807},
year = {2018},
volume = {58},
editor = {Rocha, Ricardo and Son, Tran Cao and Mears, Christopher and Saeedloei, Neda},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/OASIcs.ICLP.2017.8},
URN = {urn:nbn:de:0030-drops-84570},
doi = {10.4230/OASIcs.ICLP.2017.8},
annote = {Keywords: Effect Axioms, Event Calculus, Event Recognition, Probabilistic Logic Programming, Reasoning under Uncertainty}
}
Document
Towards Run-time Checks Simplification via Term Hiding
Abstract
One of the most attractive features of untyped languages for programmers
is the flexibility in term creation and manipulation.
However, with such power comes the responsibility of ensuring
correctness of operations.
A solution is adding run-time checks to the program via assertions, but
this can introduce overheads that are in many cases impractical.
While such overheads can be greatly reduced with static analysis, the
gains depend strongly on the quality of the information inferred.
Reusable libraries, i.e., library modules that are pre-compiled
independently of the client, pose special challenges in this context.
We propose a relaxed form of atom-based module system (which hides only
a selected set of functor symbols but still provides a strict mechanism
to prevent breaking visibility rules across modules) that can enrich
significantly the shape information that can be inferred in reusable
modular programs.
We also propose an improved run-time checking approach that takes
advantage of the proposed mechanisms to achieve large reductions in
overhead, closer to those of static languages even in the
reusable-library context.
While the approach is general and system-independent, we present it for
concreteness in the context of the Ciao assertion language and combined
static/dynamic checking framework.
Our method maintains full expressiveness of the checks in this context.
Contrary to other approaches it does not introduce the need to switch
the language to (static) type systems, which is known to change the
semantics in languages like Prolog.
We also study the approach experimentally and evaluate the overhead
reduction achieved in the run-time checks.
Cite as
Nataliia Stulova, Jose F. Morales, and Manuel V. Hermenegildo. Towards Run-time Checks Simplification via Term Hiding. In Technical Communications of the 33rd International Conference on Logic Programming (ICLP 2017). Open Access Series in Informatics (OASIcs), Volume 58, pp. 9:1-9:3, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2018)
Copy BibTex To Clipboard
@InProceedings{stulova_et_al:OASIcs.ICLP.2017.9,
author = {Stulova, Nataliia and Morales, Jose F. and Hermenegildo, Manuel V.},
title = {{Towards Run-time Checks Simplification via Term Hiding}},
booktitle = {Technical Communications of the 33rd International Conference on Logic Programming (ICLP 2017)},
pages = {9:1--9:3},
series = {Open Access Series in Informatics (OASIcs)},
ISBN = {978-3-95977-058-3},
ISSN = {2190-6807},
year = {2018},
volume = {58},
editor = {Rocha, Ricardo and Son, Tran Cao and Mears, Christopher and Saeedloei, Neda},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/OASIcs.ICLP.2017.9},
URN = {urn:nbn:de:0030-drops-84601},
doi = {10.4230/OASIcs.ICLP.2017.9},
annote = {Keywords: Module Systems, Implementation, Run-time Checking, Assertion-based Debugging and Validation, Static Analysis}
}
Document
A Hitchhiker's Guide to Reinventing a Prolog Machine
Abstract
We take a fresh, "clean-room" look at implementing Prolog by deriving its translation to an executable representation
and its execution algorithm from a simple Horn Clause meta-interpreter.
The resulting design has some interesting properties.
The heap representation of terms and the abstract machine instruction encodings are the same.
No dedicated code area is used as the code is placed directly on the heap.
Unification and indexing operations are orthogonal.
Filtering of matching clauses happens without building new structures on the heap.
Variables in function and predicate symbol positions are handled with no performance penalty.
A simple English-like syntax is used as an intermediate representation for clauses and goals and
the same simple syntax can be used by programmers directly as an alternative to classic Prolog syntax.
Solutions of (multiple) logic engines are exposed as answer streams
that can be combined through typical functional programming patterns,
with flexibility to stop, resume, encapsulate and interleave executions.
Performance of a basic interpreter implementing our design is within a factor of 2 of a highly optimized compiled
WAM-based system using the same host language.
To help placing our design on the fairly rich map of Prolog systems, we discuss similarities
to existing Prolog abstract machines, with emphasis on separating necessary
commonalities from arbitrary implementation choices.
Cite as
Paul Tarau. A Hitchhiker's Guide to Reinventing a Prolog Machine. In Technical Communications of the 33rd International Conference on Logic Programming (ICLP 2017). Open Access Series in Informatics (OASIcs), Volume 58, pp. 10:1-10:16, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2018)
Copy BibTex To Clipboard
@InProceedings{tarau:OASIcs.ICLP.2017.10,
author = {Tarau, Paul},
title = {{A Hitchhiker's Guide to Reinventing a Prolog Machine}},
booktitle = {Technical Communications of the 33rd International Conference on Logic Programming (ICLP 2017)},
pages = {10:1--10:16},
series = {Open Access Series in Informatics (OASIcs)},
ISBN = {978-3-95977-058-3},
ISSN = {2190-6807},
year = {2018},
volume = {58},
editor = {Rocha, Ricardo and Son, Tran Cao and Mears, Christopher and Saeedloei, Neda},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/OASIcs.ICLP.2017.10},
URN = {urn:nbn:de:0030-drops-84537},
doi = {10.4230/OASIcs.ICLP.2017.10},
annote = {Keywords: Prolog abstract machines, heap representation of terms and code, immutable goal stacks, natural language syntax for clauses, answer streams, multi-arg}
}
Document
Efficient Declarative Solutions in Picat for Optimal Multi-Agent Pathfinding
Abstract
The multi-agent pathfinding (MAPF) problem has attracted considerable attention because of its relation to practical applications. The majority of solutions for MAPF are algorithmic. Recently, declarative solutions that reduce MAPF to encodings for off-the-shelf solvers have achieved remarkable success. We present a constraint-based declarative model for MAPF, together with its implementation in Picat, which uses SAT and MIP. We consider both the makespan and the sum-of-costs objectives, and propose a preprocessing technique for improving the performance of the model. Experimental results show that the implementation using SAT is highly competitive. We also analyze the high performance of the SAT solution by relating it to the SAT encoding algorithms that are used in the Picat compiler.
Cite as
Neng-Fa Zhou and Roman Bartak. Efficient Declarative Solutions in Picat for Optimal Multi-Agent Pathfinding. In Technical Communications of the 33rd International Conference on Logic Programming (ICLP 2017). Open Access Series in Informatics (OASIcs), Volume 58, pp. 11:1-11:2, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2018)
Copy BibTex To Clipboard
@InProceedings{zhou_et_al:OASIcs.ICLP.2017.11,
author = {Zhou, Neng-Fa and Bartak, Roman},
title = {{Efficient Declarative Solutions in Picat for Optimal Multi-Agent Pathfinding}},
booktitle = {Technical Communications of the 33rd International Conference on Logic Programming (ICLP 2017)},
pages = {11:1--11:2},
series = {Open Access Series in Informatics (OASIcs)},
ISBN = {978-3-95977-058-3},
ISSN = {2190-6807},
year = {2018},
volume = {58},
editor = {Rocha, Ricardo and Son, Tran Cao and Mears, Christopher and Saeedloei, Neda},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/OASIcs.ICLP.2017.11},
URN = {urn:nbn:de:0030-drops-84595},
doi = {10.4230/OASIcs.ICLP.2017.11},
annote = {Keywords: Multi-agent Path Finding, SAT, MIP, Picat}
}
Document
Treewidth in Non-Ground Answer Set Solving and Alliance Problems in Graphs
Abstract
To solve hard problems efficiently via answer set programming (ASP), a promising approach is to take advantage of the fact that real-world instances of many hard problems exhibit small treewidth. Algorithms that exploit this have already been proposed -- however, they suffer from an enormous overhead. In the thesis, we present improvements in the algorithmic methodology for leveraging bounded treewidth that are especially targeted toward problems involving subset minimization. This can be useful for many problems at the second level of the polynomial hierarchy like solving disjunctive ground ASP. Moreover, we define classes of non-ground ASP programs such that grounding such a program together with input facts does not lead to an excessive increase in treewidth of the resulting ground program when compared to the treewidth of the input. This allows ASP users to take advantage of the fact that state-of-the-art ASP solvers perform better on ground programs of small treewidth. Finally, we resolve several open questions on the complexity of alliance problems in graphs. In particular, we settle the long-standing open questions of the complexity of the Secure Set problem and whether the Defensive Alliance problem is fixed-parameter tractable when parameterized by treewidth.
Cite as
Bernhard Bliem. Treewidth in Non-Ground Answer Set Solving and Alliance Problems in Graphs. In Technical Communications of the 33rd International Conference on Logic Programming (ICLP 2017). Open Access Series in Informatics (OASIcs), Volume 58, pp. 12:1-12:12, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2018)
Copy BibTex To Clipboard
@InProceedings{bliem:OASIcs.ICLP.2017.12,
author = {Bliem, Bernhard},
title = {{Treewidth in Non-Ground Answer Set Solving and Alliance Problems in Graphs}},
booktitle = {Technical Communications of the 33rd International Conference on Logic Programming (ICLP 2017)},
pages = {12:1--12:12},
series = {Open Access Series in Informatics (OASIcs)},
ISBN = {978-3-95977-058-3},
ISSN = {2190-6807},
year = {2018},
volume = {58},
editor = {Rocha, Ricardo and Son, Tran Cao and Mears, Christopher and Saeedloei, Neda},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/OASIcs.ICLP.2017.12},
URN = {urn:nbn:de:0030-drops-84656},
doi = {10.4230/OASIcs.ICLP.2017.12},
annote = {Keywords: answer set programming, treewidth, secure set, defensive alliance, parameterized complexity}
}
Document
Achieving High Quality Knowledge Acquisition using Controlled Natural Language
Abstract
Controlled Natural Languages (CNLs) are efficient languages for knowledge acquisition and reasoning. They are designed as a subset of natural languages with restricted grammar while being highly expressive. CNLs are designed to be automatically translated into logical representations, which can be fed into rule engines for query and reasoning. In this work, we build a knowledge acquisition machine, called KAM, that extends Attempto Controlled English (ACE) and achieves three goals. First, KAM can identify CNL sentences that correspond to the same logical representation but expressed in various syntactical forms. Second, KAM provides a graphical user interface (GUI) that allows users to disambiguate the knowledge acquired from text and incorporates user feedback to improve knowledge acquisition quality. Third, KAM uses a paraconsistent logical framework to encode CNL sentences in order to achieve reasoning in the presence of inconsistent knowledge.
Cite as
Tiantian Gao. Achieving High Quality Knowledge Acquisition using Controlled Natural Language. In Technical Communications of the 33rd International Conference on Logic Programming (ICLP 2017). Open Access Series in Informatics (OASIcs), Volume 58, pp. 13:1-13:10, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2018)
Copy BibTex To Clipboard
@InProceedings{gao:OASIcs.ICLP.2017.13,
author = {Gao, Tiantian},
title = {{Achieving High Quality Knowledge Acquisition using Controlled Natural Language}},
booktitle = {Technical Communications of the 33rd International Conference on Logic Programming (ICLP 2017)},
pages = {13:1--13:10},
series = {Open Access Series in Informatics (OASIcs)},
ISBN = {978-3-95977-058-3},
ISSN = {2190-6807},
year = {2018},
volume = {58},
editor = {Rocha, Ricardo and Son, Tran Cao and Mears, Christopher and Saeedloei, Neda},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/OASIcs.ICLP.2017.13},
URN = {urn:nbn:de:0030-drops-84645},
doi = {10.4230/OASIcs.ICLP.2017.13},
annote = {Keywords: Logic Programming, Controlled Natural Languages, Knowledge Acquisition}
}
Document
A Simple Complete Search for Logic Programming
Abstract
Here, we present a family of complete interleaving depth-first search strategies for embedded, domain-specific logic languages. We derive our search family from a stream-based implementation of incomplete depth-first search. The DSL's programs' texts induce particular strategies guaranteed to be complete.
Cite as
Jason Hemann, Daniel P. Friedman, William E. Byrd, and Matthew Might. A Simple Complete Search for Logic Programming. In Technical Communications of the 33rd International Conference on Logic Programming (ICLP 2017). Open Access Series in Informatics (OASIcs), Volume 58, pp. 14:1-14:8, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2018)
Copy BibTex To Clipboard
@InProceedings{hemann_et_al:OASIcs.ICLP.2017.14,
author = {Hemann, Jason and Friedman, Daniel P. and Byrd, William E. and Might, Matthew},
title = {{A Simple Complete Search for Logic Programming}},
booktitle = {Technical Communications of the 33rd International Conference on Logic Programming (ICLP 2017)},
pages = {14:1--14:8},
series = {Open Access Series in Informatics (OASIcs)},
ISBN = {978-3-95977-058-3},
ISSN = {2190-6807},
year = {2018},
volume = {58},
editor = {Rocha, Ricardo and Son, Tran Cao and Mears, Christopher and Saeedloei, Neda},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/OASIcs.ICLP.2017.14},
URN = {urn:nbn:de:0030-drops-84676},
doi = {10.4230/OASIcs.ICLP.2017.14},
annote = {Keywords: logic programming, streams, search, Racket, backtracking, relational programming}
}
Document
On Improving Run-time Checking in Dynamic Languages
Abstract
In order to detect incorrect program behaviors, a number of approaches
have been proposed, which include a combination of language-level
constructs (procedure-level annotations such as assertions/contracts,
gradual types, etc.) and associated tools (such as static code analyzers
and run-time verification frameworks).
However, it is often the case that these constructs and tools are not
used to their full extent in practice due to a number of limitations
such as excessive run-time overhead and/or limited expressiveness.
The issue is especially prominent in the context of dynamic
languages without an underlying strong type system, such as Prolog.
In our work we propose several practical solutions for minimizing the
run-time overhead associated with assertion-based verification while
keeping the correctness guarantees provided by run-time checks.
We present the solutions in the context of the Ciao system, where a
combination of an abstract interpretation-based static analyzer and
run-time verification framework is available, although our proposals
can be straightforwardly adapted to any other similar system.
Cite as
Nataliia Stulova. On Improving Run-time Checking in Dynamic Languages. In Technical Communications of the 33rd International Conference on Logic Programming (ICLP 2017). Open Access Series in Informatics (OASIcs), Volume 58, pp. 15:1-15:10, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2018)
Copy BibTex To Clipboard
@InProceedings{stulova:OASIcs.ICLP.2017.15,
author = {Stulova, Nataliia},
title = {{On Improving Run-time Checking in Dynamic Languages}},
booktitle = {Technical Communications of the 33rd International Conference on Logic Programming (ICLP 2017)},
pages = {15:1--15:10},
series = {Open Access Series in Informatics (OASIcs)},
ISBN = {978-3-95977-058-3},
ISSN = {2190-6807},
year = {2018},
volume = {58},
editor = {Rocha, Ricardo and Son, Tran Cao and Mears, Christopher and Saeedloei, Neda},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/OASIcs.ICLP.2017.15},
URN = {urn:nbn:de:0030-drops-84665},
doi = {10.4230/OASIcs.ICLP.2017.15},
annote = {Keywords: Runtime Verification, Assertions, Prolog, Logic Programming}
}