Volume
OASIcs, Volume 64
Technical Communications of the 34th International Conference on Logic Programming (ICLP 2018)
-
Part of:
Series:
Open Access Series in Informatics (OASIcs)
Conference: International Conference on Logic Programming (ICLP)
Event
ICLP 2018, July 14-17, 2018, Oxford, United KingdomEditors
Publication Details
- published at: 2018-11-19
- Publisher: Schloss Dagstuhl – Leibniz-Zentrum für Informatik
- ISBN: 978-3-95977-090-3
- DBLP: db/conf/iclp/iclp2018
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 64, ICLP'18, Complete Volume
Abstract
OASIcs, Volume 64, ICLP'18, Complete Volume
Cite as
Technical Communications of the 34th International Conference on Logic Programming (ICLP 2018). Open Access Series in Informatics (OASIcs), Volume 64, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2018)
Copy BibTex To Clipboard
@Proceedings{dalpalu_et_al:OASIcs.ICLP.2018,
title = {{OASIcs, Volume 64, ICLP'18, Complete Volume}},
booktitle = {Technical Communications of the 34th International Conference on Logic Programming (ICLP 2018)},
series = {Open Access Series in Informatics (OASIcs)},
ISBN = {978-3-95977-090-3},
ISSN = {2190-6807},
year = {2018},
volume = {64},
editor = {Dal Palu', Alessandro and Tarau, Paul and Saeedloei, Neda and Fodor, Paul},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/OASIcs.ICLP.2018},
URN = {urn:nbn:de:0030-drops-98979},
doi = {10.4230/OASIcs.ICLP.2018},
annote = {Keywords: Software and its engineering, Constraint and logic languages, Theory of computation, Logic, Constraint and logic programming}
}
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 34th International Conference on Logic Programming (ICLP 2018). Open Access Series in Informatics (OASIcs), Volume 64, pp. 0:i-0:x, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2018)
Copy BibTex To Clipboard
@InProceedings{dalpalu_et_al:OASIcs.ICLP.2018.0,
author = {Dal Palu', Alessandro and Tarau, Paul and Saeedloei, Neda and Fodor, Paul},
title = {{Front Matter, Table of Contents, Preface, Conference Organization}},
booktitle = {Technical Communications of the 34th International Conference on Logic Programming (ICLP 2018)},
pages = {0:i--0:x},
series = {Open Access Series in Informatics (OASIcs)},
ISBN = {978-3-95977-090-3},
ISSN = {2190-6807},
year = {2018},
volume = {64},
editor = {Dal Palu', Alessandro and Tarau, Paul and Saeedloei, Neda and Fodor, Paul},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/OASIcs.ICLP.2018.0},
URN = {urn:nbn:de:0030-drops-98669},
doi = {10.4230/OASIcs.ICLP.2018.0},
annote = {Keywords: Front Matter, Table of Contents, Preface, Conference Organization}
}
Document
Epistemic Logic Programs with World View Constraints
Abstract
An epistemic logic program is a set of rules written in the language of Epistemic Specifications, an extension of the language of answer set programming that provides for more powerful introspective reasoning through the use of modal operators K and M. We propose adding a new construct to Epistemic Specifications called a world view constraint that provides a universal device for expressing global constraints in the various versions of the language. We further propose the use of subjective literals (literals preceded by K or M) in rule heads as syntactic sugar for world view constraints. Additionally, we provide an algorithm for finding the world views of such programs.
Cite as
Patrick Thor Kahl and Anthony P. Leclerc. Epistemic Logic Programs with World View Constraints. In Technical Communications of the 34th International Conference on Logic Programming (ICLP 2018). Open Access Series in Informatics (OASIcs), Volume 64, pp. 1:1-1:17, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2018)
Copy BibTex To Clipboard
@InProceedings{kahl_et_al:OASIcs.ICLP.2018.1,
author = {Kahl, Patrick Thor and Leclerc, Anthony P.},
title = {{Epistemic Logic Programs with World View Constraints}},
booktitle = {Technical Communications of the 34th International Conference on Logic Programming (ICLP 2018)},
pages = {1:1--1:17},
series = {Open Access Series in Informatics (OASIcs)},
ISBN = {978-3-95977-090-3},
ISSN = {2190-6807},
year = {2018},
volume = {64},
editor = {Dal Palu', Alessandro and Tarau, Paul and Saeedloei, Neda and Fodor, Paul},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/OASIcs.ICLP.2018.1},
URN = {urn:nbn:de:0030-drops-98679},
doi = {10.4230/OASIcs.ICLP.2018.1},
annote = {Keywords: Epistemic Specifications, Epistemic Logic Programs, Constraints, World View Constraints, World View Rules, WV Facts, Answer Set Programming, Logic Programming}
}
Document
Cumulative Scoring-Based Induction of Default Theories
Abstract
Significant research has been conducted in recent years to extend Inductive Logic Programming (ILP) methods to induce a more expressive class of logic programs such as answer set programs. The methods proposed perform an exhaustive search for the correct hypothesis. Thus, they are sound but not scalable to real-life datasets. Lack of scalability and inability to deal with noisy data in real-life datasets restricts their applicability. In contrast, top-down ILP algorithms such as FOIL, can easily guide the search using heuristics and tolerate noise. They also scale up very well, due to the greedy nature of search for best hypothesis. However, in some cases despite having ample positive and negative examples, heuristics fail to direct the search in the correct direction. In this paper, we introduce the FOLD 2.0 algorithm - an enhanced version of our recently developed algorithm called FOLD. Our original FOLD algorithm automates the inductive learning of default theories. The enhancements presented here preserve the greedy nature of hypothesis search during clause specialization. These enhancements also avoid being stuck in local optima - a major pitfall of FOIL-like algorithms. Experiments that we report in this paper, suggest a significant improvement in terms of accuracy and expressiveness of the class of induced hypotheses. To the best of our knowledge, our FOLD 2.0 algorithm is the first heuristic based, scalable, and noise-resilient ILP system to induce answer set programs.
Cite as
Farhad Shakerin and Gopal Gupta. Cumulative Scoring-Based Induction of Default Theories. In Technical Communications of the 34th International Conference on Logic Programming (ICLP 2018). Open Access Series in Informatics (OASIcs), Volume 64, pp. 2:1-2:15, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2018)
Copy BibTex To Clipboard
@InProceedings{shakerin_et_al:OASIcs.ICLP.2018.2,
author = {Shakerin, Farhad and Gupta, Gopal},
title = {{Cumulative Scoring-Based Induction of Default Theories}},
booktitle = {Technical Communications of the 34th International Conference on Logic Programming (ICLP 2018)},
pages = {2:1--2:15},
series = {Open Access Series in Informatics (OASIcs)},
ISBN = {978-3-95977-090-3},
ISSN = {2190-6807},
year = {2018},
volume = {64},
editor = {Dal Palu', Alessandro and Tarau, Paul and Saeedloei, Neda and Fodor, Paul},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/OASIcs.ICLP.2018.2},
URN = {urn:nbn:de:0030-drops-98685},
doi = {10.4230/OASIcs.ICLP.2018.2},
annote = {Keywords: Inductive Logic Programming, Negation As Failure, Answer Set Programming, Default reasoning, Machine learning}
}
Document
Introspecting Preferences in Answer Set Programming
Abstract
This paper develops a logic programming language, ASP^EP, that extends answer set programming language with a new epistemic operator >~_x where x in {#,supseteq}. The operator are used between two literals in rules bodies, and thus allows for the representation of introspections of preferences in the presence of multiple belief sets: G >~_# F expresses that G is preferred to F by the cardinality of the sets, and G >~_supseteq F expresses G is preferred to F by the set-theoretic inclusion. We define the semantics of ASP^EP, explore the relation to the languages of strong introspections, and study the applications of ASP^EP by modeling the Monty Hall problem and the principle of majority.
Cite as
Zhizheng Zhang. Introspecting Preferences in Answer Set Programming. In Technical Communications of the 34th International Conference on Logic Programming (ICLP 2018). Open Access Series in Informatics (OASIcs), Volume 64, pp. 3:1-3:13, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2018)
Copy BibTex To Clipboard
@InProceedings{zhang:OASIcs.ICLP.2018.3,
author = {Zhang, Zhizheng},
title = {{Introspecting Preferences in Answer Set Programming}},
booktitle = {Technical Communications of the 34th International Conference on Logic Programming (ICLP 2018)},
pages = {3:1--3:13},
series = {Open Access Series in Informatics (OASIcs)},
ISBN = {978-3-95977-090-3},
ISSN = {2190-6807},
year = {2018},
volume = {64},
editor = {Dal Palu', Alessandro and Tarau, Paul and Saeedloei, Neda and Fodor, Paul},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/OASIcs.ICLP.2018.3},
URN = {urn:nbn:de:0030-drops-98694},
doi = {10.4230/OASIcs.ICLP.2018.3},
annote = {Keywords: Answer Set, Preference, Introspection}
}
Document
A New Proof-Theoretical Linear Semantics for CHR
Abstract
Constraint handling rules are a committed-choice language consisting of multiple-heads guarded rules that rewrite constraints into simpler ones until they are solved. We propose a new proof-theoretical declarative linear semantics for Constraint Handling Rules. We demonstrate completeness and soundness of our semantics w.r.t. operational omega_t. semantics. We propose also a translation from this semantics to linear logic.
Cite as
Igor Stéphan. A New Proof-Theoretical Linear Semantics for CHR. In Technical Communications of the 34th International Conference on Logic Programming (ICLP 2018). Open Access Series in Informatics (OASIcs), Volume 64, pp. 4:1-4:17, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2018)
Copy BibTex To Clipboard
@InProceedings{stephan:OASIcs.ICLP.2018.4,
author = {St\'{e}phan, Igor},
title = {{A New Proof-Theoretical Linear Semantics for CHR}},
booktitle = {Technical Communications of the 34th International Conference on Logic Programming (ICLP 2018)},
pages = {4:1--4:17},
series = {Open Access Series in Informatics (OASIcs)},
ISBN = {978-3-95977-090-3},
ISSN = {2190-6807},
year = {2018},
volume = {64},
editor = {Dal Palu', Alessandro and Tarau, Paul and Saeedloei, Neda and Fodor, Paul},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/OASIcs.ICLP.2018.4},
URN = {urn:nbn:de:0030-drops-98707},
doi = {10.4230/OASIcs.ICLP.2018.4},
annote = {Keywords: Constraint Handling Rules, Linear Logic}
}
Document
CHR^vis: Syntax and Semantics
Abstract
The work in the paper presents an animation extension (CHR^{vis}) to Constraint Handling Rules (CHR). Visualizations have always helped programmers understand data and debug programs. A picture is worth a thousand words. It can help identify where a problem is or show how something works. It can even illustrate a relation that was not clear otherwise. CHR^{vis} aims at embedding animation and visualization features into CHR programs. It thus enables users, while executing programs, to have such executions animated. The paper aims at providing the operational semantics for CHR^{vis}. The correctness of CHR^{vis} programs is also discussed.
Cite as
Nada Sharaf, Slim Abdennadher, and Thom Frühwirth. CHR^vis: Syntax and Semantics. In Technical Communications of the 34th International Conference on Logic Programming (ICLP 2018). Open Access Series in Informatics (OASIcs), Volume 64, pp. 5:1-5:20, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2018)
Copy BibTex To Clipboard
@InProceedings{sharaf_et_al:OASIcs.ICLP.2018.5,
author = {Sharaf, Nada and Abdennadher, Slim and Fr\"{u}hwirth, Thom},
title = {{CHR^vis: Syntax and Semantics}},
booktitle = {Technical Communications of the 34th International Conference on Logic Programming (ICLP 2018)},
pages = {5:1--5:20},
series = {Open Access Series in Informatics (OASIcs)},
ISBN = {978-3-95977-090-3},
ISSN = {2190-6807},
year = {2018},
volume = {64},
editor = {Dal Palu', Alessandro and Tarau, Paul and Saeedloei, Neda and Fodor, Paul},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/OASIcs.ICLP.2018.5},
URN = {urn:nbn:de:0030-drops-98716},
doi = {10.4230/OASIcs.ICLP.2018.5},
annote = {Keywords: Constraint Handling Rules, Visualization, Animation}
}
Document
Improving Candidate Quality of Probabilistic Logic Models
Abstract
Many real-world phenomena exhibit both relational structure and uncertainty. Probabilistic Inductive Logic Programming (PILP) uses Inductive Logic Programming (ILP) extended with probabilistic facts to produce meaningful and interpretable models for real-world phenomena. This merge between First Order Logic (FOL) theories and uncertainty makes PILP a very adequate tool for knowledge representation and extraction. However, this flexibility is coupled with a problem (inherited from ILP) of exponential search space growth and so, often, only a subset of all possible models is explored due to limited resources. Furthermore, the probabilistic evaluation of FOL theories, coming from the underlying probabilistic logic language and its solver, is also computationally demanding. This work introduces a prediction-based pruning strategy, which can reduce the search space based on the probabilistic evaluation of models, and a safe pruning criterion, which guarantees that the optimal model is not pruned away, as well as two alternative more aggressive criteria that do not provide this guarantee. Experiments performed using three benchmarks from different areas show that prediction pruning is effective in (i) maintaining predictive accuracy for all criteria and experimental settings; (ii) reducing the execution time when using some of the more aggressive criteria, compared to using no pruning; and (iii) selecting better candidate models in limited resource settings, also when compared to using no pruning.
Cite as
Joana Côrte-Real, Anton Dries, Inês Dutra, and Ricardo Rocha. Improving Candidate Quality of Probabilistic Logic Models. In Technical Communications of the 34th International Conference on Logic Programming (ICLP 2018). Open Access Series in Informatics (OASIcs), Volume 64, pp. 6:1-6:14, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2018)
Copy BibTex To Clipboard
@InProceedings{cortereal_et_al:OASIcs.ICLP.2018.6,
author = {C\^{o}rte-Real, Joana and Dries, Anton and Dutra, In\^{e}s and Rocha, Ricardo},
title = {{Improving Candidate Quality of Probabilistic Logic Models}},
booktitle = {Technical Communications of the 34th International Conference on Logic Programming (ICLP 2018)},
pages = {6:1--6:14},
series = {Open Access Series in Informatics (OASIcs)},
ISBN = {978-3-95977-090-3},
ISSN = {2190-6807},
year = {2018},
volume = {64},
editor = {Dal Palu', Alessandro and Tarau, Paul and Saeedloei, Neda and Fodor, Paul},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/OASIcs.ICLP.2018.6},
URN = {urn:nbn:de:0030-drops-98722},
doi = {10.4230/OASIcs.ICLP.2018.6},
annote = {Keywords: Relational Machine Learning, Probabilistic Inductive Logic Programming, Search Space Pruning, Model Quality, Experiments}
}
Document
Towards Incremental and Modular Context-Sensitive Analysis
Abstract
This is an extended abstract of [I. Garcia-Contreras et al., 2018].
Cite as
Isabel Garcia-Contreras, José F. Morales, and Manuel V. Hermenegildo. Towards Incremental and Modular Context-Sensitive Analysis. In Technical Communications of the 34th International Conference on Logic Programming (ICLP 2018). Open Access Series in Informatics (OASIcs), Volume 64, pp. 7:1-7:2, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2018)
Copy BibTex To Clipboard
@InProceedings{garciacontreras_et_al:OASIcs.ICLP.2018.7,
author = {Garcia-Contreras, Isabel and Morales, Jos\'{e} F. and Hermenegildo, Manuel V.},
title = {{Towards Incremental and Modular Context-Sensitive Analysis}},
booktitle = {Technical Communications of the 34th International Conference on Logic Programming (ICLP 2018)},
pages = {7:1--7:2},
series = {Open Access Series in Informatics (OASIcs)},
ISBN = {978-3-95977-090-3},
ISSN = {2190-6807},
year = {2018},
volume = {64},
editor = {Dal Palu', Alessandro and Tarau, Paul and Saeedloei, Neda and Fodor, Paul},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/OASIcs.ICLP.2018.7},
URN = {urn:nbn:de:0030-drops-98735},
doi = {10.4230/OASIcs.ICLP.2018.7},
annote = {Keywords: Program Analysis, (Constraint) Logic Programming, Abstract Interpretation, Fixpoint Algorithms, Incremental Analysis, Modular Analysis}
}
Document
MASP-Reduce: A Proposal for Distributed Computation of Stable Models
Abstract
There has been an increasing interest in recent years towards the development of efficient solvers for Answer Set Programming (ASP) and towards the application of ASP to solve increasing more challenging problems. In particular, several recent efforts have explored the issue of scalability of ASP solvers when addressing the challenges caused by the need to ground the program before resolution. This paper offers an alternative solution to this challenge, focused on the use of distributed programming techniques to reason about ASP programs whose grounding would be prohibitive for mainstream ASP solvers. The work builds on a proposal of a characterization of answer set solving as a form of non-standard graph coloring. The paper expands this characterization to include syntactic extensions used in modern ASP (e.g., choice rules, weight constraints). We present an implementation of the solver using a distributed programming framework specifically designed to manipulate very large graphs, as provided by Apache Spark, which in turn builds on the MapReduce programming framework. Finally, we provide a few preliminary results obtained from the first prototype implementation of this approach.
Cite as
Federico Igne, Agostino Dovier, and Enrico Pontelli. MASP-Reduce: A Proposal for Distributed Computation of Stable Models. In Technical Communications of the 34th International Conference on Logic Programming (ICLP 2018). Open Access Series in Informatics (OASIcs), Volume 64, pp. 8:1-8:4, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2018)
Copy BibTex To Clipboard
@InProceedings{igne_et_al:OASIcs.ICLP.2018.8,
author = {Igne, Federico and Dovier, Agostino and Pontelli, Enrico},
title = {{MASP-Reduce: A Proposal for Distributed Computation of Stable Models}},
booktitle = {Technical Communications of the 34th International Conference on Logic Programming (ICLP 2018)},
pages = {8:1--8:4},
series = {Open Access Series in Informatics (OASIcs)},
ISBN = {978-3-95977-090-3},
ISSN = {2190-6807},
year = {2018},
volume = {64},
editor = {Dal Palu', Alessandro and Tarau, Paul and Saeedloei, Neda and Fodor, Paul},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/OASIcs.ICLP.2018.8},
URN = {urn:nbn:de:0030-drops-98749},
doi = {10.4230/OASIcs.ICLP.2018.8},
annote = {Keywords: ASP solving, Parallelism, Map-reduce}
}
Document
Declarative Algorithms in Datalog with Extrema: Their Formal Semantics Simplified
Abstract
Recent advances are making possible the use of aggregates in recursive queries thus enabling the declarative expression classic algorithms and their efficient and scalable implementation. These advances rely the notion of Pre-Mappability (PreM) of constraints that, along with the seminaive-fixpoint operational semantics, guarantees formal non-monotonic semantics for recursive programs with min and max constraints. In this extended abstract, we introduce basic templates to simplify and automate task of proving PreM.
Cite as
Carlo Zaniolo, Mohan Yang, Matteo Interlandi, Ariyam Das, Alexander Shkapsky, and Tyson Condie. Declarative Algorithms in Datalog with Extrema: Their Formal Semantics Simplified. In Technical Communications of the 34th International Conference on Logic Programming (ICLP 2018). Open Access Series in Informatics (OASIcs), Volume 64, pp. 9:1-9:3, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2018)
Copy BibTex To Clipboard
@InProceedings{zaniolo_et_al:OASIcs.ICLP.2018.9,
author = {Zaniolo, Carlo and Yang, Mohan and Interlandi, Matteo and Das, Ariyam and Shkapsky, Alexander and Condie, Tyson},
title = {{Declarative Algorithms in Datalog with Extrema: Their Formal Semantics Simplified}},
booktitle = {Technical Communications of the 34th International Conference on Logic Programming (ICLP 2018)},
pages = {9:1--9:3},
series = {Open Access Series in Informatics (OASIcs)},
ISBN = {978-3-95977-090-3},
ISSN = {2190-6807},
year = {2018},
volume = {64},
editor = {Dal Palu', Alessandro and Tarau, Paul and Saeedloei, Neda and Fodor, Paul},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/OASIcs.ICLP.2018.9},
URN = {urn:nbn:de:0030-drops-98758},
doi = {10.4230/OASIcs.ICLP.2018.9},
annote = {Keywords: Recursive Queries}
}
Document
Towards Static Performance Guarantees for Programs with Run-Time Checks
Abstract
This document is an extended abstract of the Technical Report CLIP-1/2018.0.
Cite as
Maximiliano Klemen, Nataliia Stulova, Pedro Lopez-Garcia, José F. Morales, and Manuel V. Hermenegildo. Towards Static Performance Guarantees for Programs with Run-Time Checks. In Technical Communications of the 34th International Conference on Logic Programming (ICLP 2018). Open Access Series in Informatics (OASIcs), Volume 64, pp. 10:1-10:2, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2018)
Copy BibTex To Clipboard
@InProceedings{klemen_et_al:OASIcs.ICLP.2018.10,
author = {Klemen, Maximiliano and Stulova, Nataliia and Lopez-Garcia, Pedro and Morales, Jos\'{e} F. and Hermenegildo, Manuel V.},
title = {{Towards Static Performance Guarantees for Programs with Run-Time Checks}},
booktitle = {Technical Communications of the 34th International Conference on Logic Programming (ICLP 2018)},
pages = {10:1--10:2},
series = {Open Access Series in Informatics (OASIcs)},
ISBN = {978-3-95977-090-3},
ISSN = {2190-6807},
year = {2018},
volume = {64},
editor = {Dal Palu', Alessandro and Tarau, Paul and Saeedloei, Neda and Fodor, Paul},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/OASIcs.ICLP.2018.10},
URN = {urn:nbn:de:0030-drops-98765},
doi = {10.4230/OASIcs.ICLP.2018.10},
annote = {Keywords: Run-time Checks, Assertions, Abstract Interpretation, Resource Usage Analysis}
}
Document
System Description
SMT-Based Answer Set Solver CMODELS(DIFF) (System Description)
Abstract
Many answer set solvers utilize Satisfiability solvers for search. Satisfiability Modulo Theory solvers extend Satisfiability solvers. This paper presents the CMODELS(DIFF) system that uses Satisfiability Modulo Theory solvers to find answer sets of a logic program. Its theoretical foundation is based on Niemala's characterization of answer sets of a logic program via so called level rankings. The comparative experimental analysis demonstrates that CMODELS(DIFF) is a viable answer set solver.
Cite as
Da Shen and Yuliya Lierler. SMT-Based Answer Set Solver CMODELS(DIFF) (System Description). In Technical Communications of the 34th International Conference on Logic Programming (ICLP 2018). Open Access Series in Informatics (OASIcs), Volume 64, pp. 11:1-11:15, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2018)
Copy BibTex To Clipboard
@InProceedings{shen_et_al:OASIcs.ICLP.2018.11,
author = {Shen, Da and Lierler, Yuliya},
title = {{SMT-Based Answer Set Solver CMODELS(DIFF)}},
booktitle = {Technical Communications of the 34th International Conference on Logic Programming (ICLP 2018)},
pages = {11:1--11:15},
series = {Open Access Series in Informatics (OASIcs)},
ISBN = {978-3-95977-090-3},
ISSN = {2190-6807},
year = {2018},
volume = {64},
editor = {Dal Palu', Alessandro and Tarau, Paul and Saeedloei, Neda and Fodor, Paul},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/OASIcs.ICLP.2018.11},
URN = {urn:nbn:de:0030-drops-98775},
doi = {10.4230/OASIcs.ICLP.2018.11},
annote = {Keywords: answer set programming, satisfiability modulo theories, constraint satisfaction processing}
}
Document
Learning Commonsense Knowledge Through Interactive Dialogue
Abstract
One of the most difficult problems in Artificial Intelligence is related to acquiring commonsense knowledge - to create a collection of facts and information that an ordinary person should know. In this work, we present a system that, from a limited background knowledge, is able to learn to form simple concepts through interactive dialogue with a user. We approach the problem using a syntactic parser, along with a mechanism to check for synonymy, to translate sentences into logical formulas represented in Event Calculus using Answer Set Programming (ASP). Reasoning and learning tasks are then automatically generated for the translated text, with learning being initiated through question and answering. The system is capable of learning with no contextual knowledge prior to the dialogue. The system has been evaluated on stories inspired by the Facebook's bAbI's question-answering tasks, and through appropriate question and answering is able to respond accurately to these dialogues.
Cite as
Benjamin Wu, Alessandra Russo, Mark Law, and Katsumi Inoue. Learning Commonsense Knowledge Through Interactive Dialogue. In Technical Communications of the 34th International Conference on Logic Programming (ICLP 2018). Open Access Series in Informatics (OASIcs), Volume 64, pp. 12:1-12:19, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2018)
Copy BibTex To Clipboard
@InProceedings{wu_et_al:OASIcs.ICLP.2018.12,
author = {Wu, Benjamin and Russo, Alessandra and Law, Mark and Inoue, Katsumi},
title = {{Learning Commonsense Knowledge Through Interactive Dialogue}},
booktitle = {Technical Communications of the 34th International Conference on Logic Programming (ICLP 2018)},
pages = {12:1--12:19},
series = {Open Access Series in Informatics (OASIcs)},
ISBN = {978-3-95977-090-3},
ISSN = {2190-6807},
year = {2018},
volume = {64},
editor = {Dal Palu', Alessandro and Tarau, Paul and Saeedloei, Neda and Fodor, Paul},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/OASIcs.ICLP.2018.12},
URN = {urn:nbn:de:0030-drops-98780},
doi = {10.4230/OASIcs.ICLP.2018.12},
annote = {Keywords: Commonsense Reasoning, Answer Set Programming, Event Calculus, Inductive Logic Programming}
}
Document
Application of Logic-Based Methods to Machine Component Design
Abstract
This paper describes an application worked out in collaboration with a company that produces made-to-order machine components. The goal of the project is to develop a system that can support the company's engineers by automating parts of their component design process. We propose a knowledge extraction methodology based on the recent DMN (Decision Model and Notation) standard and compare a rule-based and a constraint-based method for representing the resulting knowledge. We study the advantages and disadvantages of both approaches in the context of the company's real-life application.
Cite as
Bram Aerts and Joost Vennekens. Application of Logic-Based Methods to Machine Component Design. In Technical Communications of the 34th International Conference on Logic Programming (ICLP 2018). Open Access Series in Informatics (OASIcs), Volume 64, pp. 13:1-13:15, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2018)
Copy BibTex To Clipboard
@InProceedings{aerts_et_al:OASIcs.ICLP.2018.13,
author = {Aerts, Bram and Vennekens, Joost},
title = {{Application of Logic-Based Methods to Machine Component Design}},
booktitle = {Technical Communications of the 34th International Conference on Logic Programming (ICLP 2018)},
pages = {13:1--13:15},
series = {Open Access Series in Informatics (OASIcs)},
ISBN = {978-3-95977-090-3},
ISSN = {2190-6807},
year = {2018},
volume = {64},
editor = {Dal Palu', Alessandro and Tarau, Paul and Saeedloei, Neda and Fodor, Paul},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/OASIcs.ICLP.2018.13},
URN = {urn:nbn:de:0030-drops-98798},
doi = {10.4230/OASIcs.ICLP.2018.13},
annote = {Keywords: Application, Expert Systems, Constraint Solving, Rule-based Systems, Decision Modelling, DMN, Product Configuration}
}
Document
Explanations Generation For Web Service Workflow
Abstract
The motivation for the work is the challenge of providing textual explanations of automatically generated scientific workflows (e.g., paragraphs that scientists can include in their publications).
The extended abstract presents a system which generates explanations for a web service workflow from sets of atoms derived from a collection of ontologies. The system, called nlgPhylogeny, demonstrates the feasibility of the task in the Phylotastic project, that aims at providing evolutionary biologists with a platform for automatic generation of phylogenetic trees given some suitable inputs.
Cite as
Van Duc Nguyen, Son Cao Tran, and Enrico Pontelli. Explanations Generation For Web Service Workflow. In Technical Communications of the 34th International Conference on Logic Programming (ICLP 2018). Open Access Series in Informatics (OASIcs), Volume 64, pp. 14:1-14:3, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2018)
Copy BibTex To Clipboard
@InProceedings{nguyen_et_al:OASIcs.ICLP.2018.14,
author = {Nguyen, Van Duc and Tran, Son Cao and Pontelli, Enrico},
title = {{Explanations Generation For Web Service Workflow}},
booktitle = {Technical Communications of the 34th International Conference on Logic Programming (ICLP 2018)},
pages = {14:1--14:3},
series = {Open Access Series in Informatics (OASIcs)},
ISBN = {978-3-95977-090-3},
ISSN = {2190-6807},
year = {2018},
volume = {64},
editor = {Dal Palu', Alessandro and Tarau, Paul and Saeedloei, Neda and Fodor, Paul},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/OASIcs.ICLP.2018.14},
URN = {urn:nbn:de:0030-drops-98801},
doi = {10.4230/OASIcs.ICLP.2018.14},
annote = {Keywords: Phylotastic, Grammatical Framework}
}
Document
Probabilistic Action Language pBC+
Abstract
We present an ongoing research on a probabilistic extension of action language BC+. Just like BC+ is defined as a high-level notation of answer set programs for describing transition systems, the proposed language, which we call pBC+, is defined as a high-level notation of LP^{MLN} programs - a probabilistic extension of answer set programs.
As preliminary results accomplished, we illustrate how probabilistic reasoning about transition systems, such as prediction, postdiction, and planning problems, as well as probabilistic diagnosis for dynamic domains, can be modeled in pBC+ and computed using an implementation of LP^{MLN}.
For future work, we plan to develop a compiler that automatically translates pBC+ description into LP^{MLN} programs, as well as parameter learning in probabilistic action domains through LP^{MLN} weight learning. We will work on defining useful extensions of pBC+ to facilitate hypothetical/counterfactual reasoning. We will also find real-world applications, possibly in robotic domains, to empirically study the performance of this approach to probabilistic reasoning in action domains.
Cite as
Yi Wang. Probabilistic Action Language pBC+. In Technical Communications of the 34th International Conference on Logic Programming (ICLP 2018). Open Access Series in Informatics (OASIcs), Volume 64, pp. 15:1-15:12, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2018)
Copy BibTex To Clipboard
@InProceedings{wang:OASIcs.ICLP.2018.15,
author = {Wang, Yi},
title = {{Probabilistic Action Language pBC+}},
booktitle = {Technical Communications of the 34th International Conference on Logic Programming (ICLP 2018)},
pages = {15:1--15:12},
series = {Open Access Series in Informatics (OASIcs)},
ISBN = {978-3-95977-090-3},
ISSN = {2190-6807},
year = {2018},
volume = {64},
editor = {Dal Palu', Alessandro and Tarau, Paul and Saeedloei, Neda and Fodor, Paul},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/OASIcs.ICLP.2018.15},
URN = {urn:nbn:de:0030-drops-98818},
doi = {10.4230/OASIcs.ICLP.2018.15},
annote = {Keywords: action language, probabilistic reasoning, LP^\{MLN\}}
}
Document
Explaining Actual Causation via Reasoning About Actions and Change
Abstract
In causality, an actual cause is often defined as an event responsible for bringing about a given outcome in a scenario. In practice, however, identifying this event alone is not always sufficient to provide a satisfactory explanation of how the outcome came to be. In this paper, we motivate this claim using well-known examples and present a novel framework for reasoning more deeply about actual causation. The framework reasons over a scenario and domain knowledge to identify additional events that helped to "set the stage" for the outcome. By leveraging techniques from Reasoning about Actions and Change, the approach supports reasoning over domains in which the evolution of the state of the world over time plays a critical role and enables one to identify and explain the circumstances that led to an outcome of interest. We utilize action language AL for defining the constructs of the framework. This language lends itself quite naturally to an automated translation to Answer Set Programming, using which, reasoning tasks of considerable complexity can be specified and executed. We speculate that a similar approach can also lead to the development of algorithms for our framework.
Cite as
Emily C. LeBlanc. Explaining Actual Causation via Reasoning About Actions and Change. In Technical Communications of the 34th International Conference on Logic Programming (ICLP 2018). Open Access Series in Informatics (OASIcs), Volume 64, pp. 16:1-16:11, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2018)
Copy BibTex To Clipboard
@InProceedings{leblanc:OASIcs.ICLP.2018.16,
author = {LeBlanc, Emily C.},
title = {{Explaining Actual Causation via Reasoning About Actions and Change}},
booktitle = {Technical Communications of the 34th International Conference on Logic Programming (ICLP 2018)},
pages = {16:1--16:11},
series = {Open Access Series in Informatics (OASIcs)},
ISBN = {978-3-95977-090-3},
ISSN = {2190-6807},
year = {2018},
volume = {64},
editor = {Dal Palu', Alessandro and Tarau, Paul and Saeedloei, Neda and Fodor, Paul},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/OASIcs.ICLP.2018.16},
URN = {urn:nbn:de:0030-drops-98827},
doi = {10.4230/OASIcs.ICLP.2018.16},
annote = {Keywords: Actual Cause, Explanation, Reasoning about Actions and Change, Action Language, Answer Set Programming, Knowledge Representation and Reasoning}
}
Document
Translating P-log, LPMLN, LPOD, and CR-Prolog2 into Standard Answer Set Programs
Abstract
Answer set programming (ASP) is a particularly useful approach for nonmonotonic reasoning in knowledge representation. In order to handle quantitative and qualitative reasoning, a number of different extensions of ASP have been invented, such as quantitative extensions LP^{MLN} and P-log, and qualitative extensions LPOD, and CR-Prolog_2.
Although each of these formalisms introduced some new and unique concepts, we present reductions of each of these languages into the standard ASP language, which not only gives us an alternative insight into the semantics of these extensions in terms of the standard ASP language, but also shows that the standard ASP is capable of representing quantitative uncertainty and qualitative uncertainty. What's more, our translations yield a way to tune the semantics of LPOD and CR-Prolog_2. Since the semantics of each formalism is represented in ASP rules, we can modify their semantics by modifying the corresponding ASP rules.
For future work, we plan to create a new formalism that is capable of representing quantitative and qualitative uncertainty at the same time. Since LPOD rules are simple and informative, we will first try to include quantitative preference into LPOD by adding the concept of weight and tune the semantics of LPOD by modifying the translated standard ASP rules.
Cite as
Zhun Yang. Translating P-log, LPMLN, LPOD, and CR-Prolog2 into Standard Answer Set Programs. In Technical Communications of the 34th International Conference on Logic Programming (ICLP 2018). Open Access Series in Informatics (OASIcs), Volume 64, pp. 17:1-17:11, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2018)
Copy BibTex To Clipboard
@InProceedings{yang:OASIcs.ICLP.2018.17,
author = {Yang, Zhun},
title = {{Translating P-log, LPMLN, LPOD, and CR-Prolog2 into Standard Answer Set Programs}},
booktitle = {Technical Communications of the 34th International Conference on Logic Programming (ICLP 2018)},
pages = {17:1--17:11},
series = {Open Access Series in Informatics (OASIcs)},
ISBN = {978-3-95977-090-3},
ISSN = {2190-6807},
year = {2018},
volume = {64},
editor = {Dal Palu', Alessandro and Tarau, Paul and Saeedloei, Neda and Fodor, Paul},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/OASIcs.ICLP.2018.17},
URN = {urn:nbn:de:0030-drops-98836},
doi = {10.4230/OASIcs.ICLP.2018.17},
annote = {Keywords: answer set programming, preference, LPOD, CR-Prolog}
}
Document
Proof-Relevant Resolution for Elaboration of Programming Languages
Abstract
Proof-relevant resolution is a new variant of resolution in Horn-clause logic and its extensions. We propose proof-relevant resolution as a systematic approach to elaboration in programming languages that is close to formal specification and hence allows for analysis of semantics of the language. We demonstrate the approach on two case studies; we describe a novel, proof-relevant approach to type inference and term synthesis in dependently types languages and we show how proof-relevant resolution allows for analysis of inductive and coinductive soundness of type class resolution. We conclude by a discussion of overall contributions of our current work.
Cite as
Frantisek Farka. Proof-Relevant Resolution for Elaboration of Programming Languages. In Technical Communications of the 34th International Conference on Logic Programming (ICLP 2018). Open Access Series in Informatics (OASIcs), Volume 64, pp. 18:1-18:9, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2018)
Copy BibTex To Clipboard
@InProceedings{farka:OASIcs.ICLP.2018.18,
author = {Farka, Frantisek},
title = {{Proof-Relevant Resolution for Elaboration of Programming Languages}},
booktitle = {Technical Communications of the 34th International Conference on Logic Programming (ICLP 2018)},
pages = {18:1--18:9},
series = {Open Access Series in Informatics (OASIcs)},
ISBN = {978-3-95977-090-3},
ISSN = {2190-6807},
year = {2018},
volume = {64},
editor = {Dal Palu', Alessandro and Tarau, Paul and Saeedloei, Neda and Fodor, Paul},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/OASIcs.ICLP.2018.18},
URN = {urn:nbn:de:0030-drops-98848},
doi = {10.4230/OASIcs.ICLP.2018.18},
annote = {Keywords: resolution, elaboration, proof-relevant, dependent types, type classes}
}
Document
The Learning-Knowledge-Reasoning Paradigm for Natural Language Understanding and Question Answering
Abstract
Given a text, several questions can be asked. For some of these questions, the answer can be directly looked up from the text. However for several other questions, one might need to use additional knowledge and sophisticated reasoning to find the answer. Developing AI agents that can answer these kinds of questions and can also justify their answer is the focus of this research. Towards this goal, we use the language of Answer Set Programming as the knowledge representation and reasoning language for the agent. The question then arises, is how to obtain the additional knowledge? In this work we show that using existing Natural Language Processing parsers and a scalable Inductive Logic Programming algorithm it is possible to learn this additional knowledge (containing mostly commonsense knowledge) from question-answering datasets which then can be used for inference.
Cite as
Arindam Mitra. The Learning-Knowledge-Reasoning Paradigm for Natural Language Understanding and Question Answering. In Technical Communications of the 34th International Conference on Logic Programming (ICLP 2018). Open Access Series in Informatics (OASIcs), Volume 64, pp. 19:1-19:6, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2018)
Copy BibTex To Clipboard
@InProceedings{mitra:OASIcs.ICLP.2018.19,
author = {Mitra, Arindam},
title = {{The Learning-Knowledge-Reasoning Paradigm for Natural Language Understanding and Question Answering}},
booktitle = {Technical Communications of the 34th International Conference on Logic Programming (ICLP 2018)},
pages = {19:1--19:6},
series = {Open Access Series in Informatics (OASIcs)},
ISBN = {978-3-95977-090-3},
ISSN = {2190-6807},
year = {2018},
volume = {64},
editor = {Dal Palu', Alessandro and Tarau, Paul and Saeedloei, Neda and Fodor, Paul},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/OASIcs.ICLP.2018.19},
URN = {urn:nbn:de:0030-drops-98856},
doi = {10.4230/OASIcs.ICLP.2018.19},
annote = {Keywords: Natural Language Understanding, Question Answering, Knowledge Acquisition, Inductive Logic Programming, Knowledge Representation and Reasoning}
}
Document
Speeding up Lazy-Grounding Answer Set Solving
Abstract
The grounding bottleneck is an important open issue in Answer Set Programming. Lazy grounding addresses it by interleaving grounding and search. The performance of current lazy-grounding solvers is not yet comparable to that of ground-and-solve systems, however. The aim of this thesis is to extend prior work on lazy grounding by novel heuristics and other techniques like non-ground conflict learning in order to speed up solving. Parts of expected results will be beneficial for ground-and-solve systems as well.
Cite as
Richard Taupe. Speeding up Lazy-Grounding Answer Set Solving. In Technical Communications of the 34th International Conference on Logic Programming (ICLP 2018). Open Access Series in Informatics (OASIcs), Volume 64, pp. 20:1-20:9, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2018)
Copy BibTex To Clipboard
@InProceedings{taupe:OASIcs.ICLP.2018.20,
author = {Taupe, Richard},
title = {{Speeding up Lazy-Grounding Answer Set Solving}},
booktitle = {Technical Communications of the 34th International Conference on Logic Programming (ICLP 2018)},
pages = {20:1--20:9},
series = {Open Access Series in Informatics (OASIcs)},
ISBN = {978-3-95977-090-3},
ISSN = {2190-6807},
year = {2018},
volume = {64},
editor = {Dal Palu', Alessandro and Tarau, Paul and Saeedloei, Neda and Fodor, Paul},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/OASIcs.ICLP.2018.20},
URN = {urn:nbn:de:0030-drops-98861},
doi = {10.4230/OASIcs.ICLP.2018.20},
annote = {Keywords: answer set programming, lazy grounding, heuristics}
}
Document
Knowledge Authoring and Question Answering via Controlled Natural Language
Abstract
Knowledge acquisition from text is the process of automatically acquiring, organizing and structuring knowledge from text which can be used to perform question answering or complex reasoning. However, current state-of-the-art systems are limited by the fact that they are not able to construct the knowledge base with high quality as knowledge representation and reasoning (KRR) has a keen requirement for the accuracy of data. Controlled Natural Languages (CNLs) emerged as a technology to author knowledge using a restricted subset of English. However, they still fail to do so as sentences that express the same information may be represented by different forms. Current CNL systems have limited power to standardize sentences that express the same meaning into the same logical form. We solved this problem by building the Knowledge Authoring Logic Machine (KALM), which is a technology for domain experts who are not familiar with logic to author knowledge using CNL. The system performs semantic analysis of English sentences and achieves superior accuracy of standardizing sentences that express the same meaning to the same logical representation. Besides, we developed the query part of KALM to perform question answering, which also achieves very high accuracy in query understanding.
Cite as
Tiantian Gao. Knowledge Authoring and Question Answering via Controlled Natural Language. In Technical Communications of the 34th International Conference on Logic Programming (ICLP 2018). Open Access Series in Informatics (OASIcs), Volume 64, pp. 21:1-21:8, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2018)
Copy BibTex To Clipboard
@InProceedings{gao:OASIcs.ICLP.2018.21,
author = {Gao, Tiantian},
title = {{Knowledge Authoring and Question Answering via Controlled Natural Language}},
booktitle = {Technical Communications of the 34th International Conference on Logic Programming (ICLP 2018)},
pages = {21:1--21:8},
series = {Open Access Series in Informatics (OASIcs)},
ISBN = {978-3-95977-090-3},
ISSN = {2190-6807},
year = {2018},
volume = {64},
editor = {Dal Palu', Alessandro and Tarau, Paul and Saeedloei, Neda and Fodor, Paul},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/OASIcs.ICLP.2018.21},
URN = {urn:nbn:de:0030-drops-98870},
doi = {10.4230/OASIcs.ICLP.2018.21},
annote = {Keywords: Knowledge Authoring, Question Answering, Controlled Natural Language}
}
Document
Natural Language Generation From Ontologies Using Grammatical Framework
Abstract
The paper addresses the problem of automatic generation of natural language descriptions for ontology-described artifacts. The motivation for the work is the challenge of providing textual descriptions of automatically generated scientific workflows (e.g., paragraphs that scientists can include in their publications). The extended abstract presents a system which generates descriptions of sets of atoms derived from a collection of ontologies. The system, called nlgPhylogeny, demonstrates the feasibility of the task in the Phylotastic project, that aims at providing evolutionary biologists with a platform for automatic generation of phylogenetic trees given some suitable inputs. nlgPhylogeny utilizes the fact that the Grammatical Framework (GF) is suitable for the natural language generation (NLG) task; the abstract shows how elements of the ontologies in Phylotastic, such as web services, inputs and outputs of web services, can be encoded in GF for the NLG task.
Cite as
Van Duc Nguyen. Natural Language Generation From Ontologies Using Grammatical Framework. In Technical Communications of the 34th International Conference on Logic Programming (ICLP 2018). Open Access Series in Informatics (OASIcs), Volume 64, pp. 22:1-22:7, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2018)
Copy BibTex To Clipboard
@InProceedings{nguyen:OASIcs.ICLP.2018.22,
author = {Nguyen, Van Duc},
title = {{Natural Language Generation From Ontologies Using Grammatical Framework}},
booktitle = {Technical Communications of the 34th International Conference on Logic Programming (ICLP 2018)},
pages = {22:1--22:7},
series = {Open Access Series in Informatics (OASIcs)},
ISBN = {978-3-95977-090-3},
ISSN = {2190-6807},
year = {2018},
volume = {64},
editor = {Dal Palu', Alessandro and Tarau, Paul and Saeedloei, Neda and Fodor, Paul},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/OASIcs.ICLP.2018.22},
URN = {urn:nbn:de:0030-drops-98885},
doi = {10.4230/OASIcs.ICLP.2018.22},
annote = {Keywords: Phylotastic, Grammatical Framework}
}
Document
Model Revision of Logical Regulatory Networks Using Logic-Based Tools
Abstract
Recently, biological data has been increasingly produced calling for the existence of computational models able to organize and computationally reproduce existing observations. In particular, biological regulatory networks have been modeled relying on the Sign Consistency Model or the logical formalism. However, their construction still completely relies on a domain expert to choose the best functions for every network component. Due to the number of possible functions for k arguments, this is typically a process prone to error. Here, we propose to assist the modeler using logic-based tools to verify the model, identifying crucial network components responsible for model inconsistency. We intend to obtain a model building procedure capable of providing the modeler with repaired models satisfying a set of pre-defined criteria, therefore minimizing possible modeling errors.
Cite as
Filipe Gouveia, Inês Lynce, and Pedro T. Monteiro. Model Revision of Logical Regulatory Networks Using Logic-Based Tools. In Technical Communications of the 34th International Conference on Logic Programming (ICLP 2018). Open Access Series in Informatics (OASIcs), Volume 64, pp. 23:1-23:10, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2018)
Copy BibTex To Clipboard
@InProceedings{gouveia_et_al:OASIcs.ICLP.2018.23,
author = {Gouveia, Filipe and Lynce, In\^{e}s and Monteiro, Pedro T.},
title = {{Model Revision of Logical Regulatory Networks Using Logic-Based Tools}},
booktitle = {Technical Communications of the 34th International Conference on Logic Programming (ICLP 2018)},
pages = {23:1--23:10},
series = {Open Access Series in Informatics (OASIcs)},
ISBN = {978-3-95977-090-3},
ISSN = {2190-6807},
year = {2018},
volume = {64},
editor = {Dal Palu', Alessandro and Tarau, Paul and Saeedloei, Neda and Fodor, Paul},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/OASIcs.ICLP.2018.23},
URN = {urn:nbn:de:0030-drops-98892},
doi = {10.4230/OASIcs.ICLP.2018.23},
annote = {Keywords: Logical Regulatory Networks, Model Revision, Answer Set Programming, Boolean Satisfiability, Logic-based tools}
}
Document
Scalable Robotic Intra-Logistics with Answer Set Programming
Abstract
Over time, Answer Set Programming (ASP) has gained traction as a versatile logic programming semantics with performant processing systems, used by a growing number of significant applications in academia and industry. However, this development is threatened by a lack of commonly accepted design patterns and techniques for ASP to address dynamic application on a real-world scale. To this end, we identified robotic intra-logistics as representative scenario, a major domain of interest in the context of the fourth industrial revolution. For this setting, we aim to provide a scalable and efficient ASP-based solutions by (1) stipulating a standardized test and benchmark framework; (2) leveraging existing ASP techniques through new design patterns; and (3) extending ASP with new functionalities. In this paper we will expand on the subject matter as well as detail our current progress and future plans.
Cite as
Philipp Obermeier. Scalable Robotic Intra-Logistics with Answer Set Programming. In Technical Communications of the 34th International Conference on Logic Programming (ICLP 2018). Open Access Series in Informatics (OASIcs), Volume 64, pp. 24:1-24:5, Schloss Dagstuhl – Leibniz-Zentrum für Informatik (2018)
Copy BibTex To Clipboard
@InProceedings{obermeier:OASIcs.ICLP.2018.24,
author = {Obermeier, Philipp},
title = {{Scalable Robotic Intra-Logistics with Answer Set Programming}},
booktitle = {Technical Communications of the 34th International Conference on Logic Programming (ICLP 2018)},
pages = {24:1--24:5},
series = {Open Access Series in Informatics (OASIcs)},
ISBN = {978-3-95977-090-3},
ISSN = {2190-6807},
year = {2018},
volume = {64},
editor = {Dal Palu', Alessandro and Tarau, Paul and Saeedloei, Neda and Fodor, Paul},
publisher = {Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
address = {Dagstuhl, Germany},
URL = {https://drops.dagstuhl.de/entities/document/10.4230/OASIcs.ICLP.2018.24},
URN = {urn:nbn:de:0030-drops-98907},
doi = {10.4230/OASIcs.ICLP.2018.24},
annote = {Keywords: Answer Set Programming, Logistics, Planning}
}