@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}
}
@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}
}
@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}
}
@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}
}
@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}
}
@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}
}
@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}
}
@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}
}
@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}
}
@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}
}
@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}
}
@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}
}
@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}
}
@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}
}
@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}
}
@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}
}
@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}
}
The metadata provided by Dagstuhl Publishing on its webpages, as well as their export formats (such as XML or BibTeX) available at our website, is released under the CC0 1.0 Public Domain Dedication license. That is, you are free to copy, distribute, use, modify, transform, build upon, and produce derived works from our data, even for commercial purposes, all without asking permission. Of course, we are always happy if you provide a link to us as the source of the data.
Read the full CC0 1.0 legal code for the exact terms that apply: https://creativecommons.org/publicdomain/zero/1.0/legalcode
Feedback for Dagstuhl Publishing