29 Search Results for "King, Andy"


Volume

OASIcs, Volume 52

Technical Communications of the 32nd International Conference on Logic Programming (ICLP 2016)

ICLP 2016 TCs, October 16-21, 2016, New York City, USA

Editors: Manuel Carro, Andy King, Neda Saeedloei, and Marina De Vos

Document
Dynamic and Static Task Allocation for Hard Real-Time Video Stream Decoding on NoCs

Authors: Hashan R. Mendis, Neil C. Audsley, and Leandro Soares Indrusiak

Published in: LITES, Volume 4, Issue 2 (2017). Leibniz Transactions on Embedded Systems, Volume 4, Issue 2


Abstract
Hard real-time (HRT) video systems require admission control decisions that rely on two factors. Firstly, schedulability analysis of the data-dependent, communicating tasks within the application need to be carried out in order to guarantee timing and predictability. Secondly, the allocation of the tasks to multi-core processing elements would generate different results in the schedulability analysis. Due to the conservative nature of the state-of-the-art schedulability analysis of tasks and message flows, and the unpredictability in the application, the system resources are often under-utilised. In this paper we propose two blocking-aware dynamic task allocation techniques that exploit application and platform characteristics, in order to increase the number of simultaneous, fully schedulable, video streams handled by the system. A novel, worst-case response time aware, search-based, static hard real-time task mapper is introduced to act as an upper-baseline to the proposed techniques. Further evaluations are carried out against existing heuristic-based dynamic mappers. Improvements to the admission rates and the system utilisation under a range of different workloads and platform sizes are explored.

Cite as

Hashan R. Mendis, Neil C. Audsley, and Leandro Soares Indrusiak. Dynamic and Static Task Allocation for Hard Real-Time Video Stream Decoding on NoCs. In LITES, Volume 4, Issue 2 (2017). Leibniz Transactions on Embedded Systems, Volume 4, Issue 2, pp. 01:1-01:25, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2017)


Copy BibTex To Clipboard

@Article{mendis_et_al:LITES-v004-i002-a001,
  author =	{Mendis, Hashan R. and Audsley, Neil C. and Indrusiak, Leandro Soares},
  title =	{{Dynamic and Static Task Allocation for Hard Real-Time Video Stream Decoding on NoCs}},
  booktitle =	{LITES, Volume 4, Issue 2 (2017)},
  pages =	{01:1--01:25},
  journal =	{Leibniz Transactions on Embedded Systems},
  ISSN =	{2199-2002},
  year =	{2017},
  volume =	{4},
  number =	{2},
  editor =	{Mendis, Hashan R. and Audsley, Neil C. and Indrusiak, Leandro Soares},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/LITES-v004-i002-a001},
  doi =		{10.4230/LITES-v004-i002-a001},
  annote =	{Keywords: Real-time multimedia, Task mapping, Network-on-chip}
}
Document
Complete Volume
OASIcs, Volume 52, ICLP'16, Complete Volume

Authors: Manuel Carro, Andy King, Neda Saeedloei, and Marina De Vos

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


Abstract
OASIcs, Volume 52, ICLP'16, Complete Volume

Cite as

Manuel Carro, Andy King, Neda Saeedloei, and Marina De Vos. OASIcs, Volume 52, ICLP'16, Complete Volume. In Technical Communications of the 32nd International Conference on Logic Programming (ICLP 2016). Open Access Series in Informatics (OASIcs), Volume 52, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2016)


Copy BibTex To Clipboard

@Proceedings{carro_et_al:OASIcs.ICLP.2016,
  title =	{{OASIcs, Volume 52, ICLP'16, Complete Volume}},
  booktitle =	{Technical Communications of the 32nd International Conference on Logic Programming (ICLP 2016)},
  series =	{Open Access Series in Informatics (OASIcs)},
  ISBN =	{978-3-95977-007-1},
  ISSN =	{2190-6807},
  year =	{2016},
  volume =	{52},
  editor =	{Carro, Manuel and King, Andy and Saeedloei, Neda and De Vos, Marina},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/OASIcs.ICLP.2016},
  URN =		{urn:nbn:de:0030-drops-67654},
  doi =		{10.4230/OASIcs.ICLP.2016},
  annote =	{Keywords: Programming, Formal Definitions and Theory, Language Clasifications, Language Constructs and Features, Models of Computation, Semantics of Programming Languages, Mathematical Logic, Grammars and Other Rewriting Systems, Database Administration, Data Mining, Applications and Expert Systems,}
}
Document
Front Matter
Front Matter, Table of Contents, Preface, List of Authors

Authors: Manuel Carro, Andy King, Neda Saeedloei, and Marina De Vos

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


Abstract
Front Matter, Table of Contents, Preface, List of Authors

Cite as

Manuel Carro, Andy King, Neda Saeedloei, and Marina De Vos. Front Matter, Table of Contents, Preface, List of Authors. In Technical Communications of the 32nd International Conference on Logic Programming (ICLP 2016). Open Access Series in Informatics (OASIcs), Volume 52, pp. 0:i-0:xvi, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2016)


Copy BibTex To Clipboard

@InProceedings{carro_et_al:OASIcs.ICLP.2016.0,
  author =	{Carro, Manuel and King, Andy and Saeedloei, Neda and De Vos, Marina},
  title =	{{Front Matter, Table of Contents, Preface, List of Authors}},
  booktitle =	{Technical Communications of the 32nd International Conference on Logic Programming (ICLP 2016)},
  pages =	{0:i--0:xvi},
  series =	{Open Access Series in Informatics (OASIcs)},
  ISBN =	{978-3-95977-007-1},
  ISSN =	{2190-6807},
  year =	{2016},
  volume =	{52},
  editor =	{Carro, Manuel and King, Andy and Saeedloei, Neda and De Vos, Marina},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/OASIcs.ICLP.2016.0},
  URN =		{urn:nbn:de:0030-drops-67538},
  doi =		{10.4230/OASIcs.ICLP.2016.0},
  annote =	{Keywords: Front Matter, Table of Contents, Preface, List of Authors}
}
Document
System Description
SMT-Based Constraint Answer Set Solver EZSMT (System Description)

Authors: Benjamin Susman and Yuliya Lierler

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


Abstract
Constraint answer set programming is a promising research direction that integrates answer set programming with constraint processing. Recently, the formal link between this research area and satisfiability modulo theories (or SMT) was established. This link allows the cross-fertilization between traditionally different solving technologies. The paper presents the system ezsmt, one of the first SMT-based solvers for constraint answer set programming. It also presents the comparative analysis of the performance of ezsmt in relation to its peers including solvers EZCSP, CLINGCON, and MINGO. Experimental results demonstrate that SMT is a viable technology for constraint answer set programming.

Cite as

Benjamin Susman and Yuliya Lierler. SMT-Based Constraint Answer Set Solver EZSMT (System Description). In Technical Communications of the 32nd International Conference on Logic Programming (ICLP 2016). Open Access Series in Informatics (OASIcs), Volume 52, pp. 1:1-1:15, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2016)


Copy BibTex To Clipboard

@InProceedings{susman_et_al:OASIcs.ICLP.2016.1,
  author =	{Susman, Benjamin and Lierler, Yuliya},
  title =	{{SMT-Based Constraint Answer Set Solver EZSMT}},
  booktitle =	{Technical Communications of the 32nd International Conference on Logic Programming (ICLP 2016)},
  pages =	{1:1--1:15},
  series =	{Open Access Series in Informatics (OASIcs)},
  ISBN =	{978-3-95977-007-1},
  ISSN =	{2190-6807},
  year =	{2016},
  volume =	{52},
  editor =	{Carro, Manuel and King, Andy and Saeedloei, Neda and De Vos, Marina},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/OASIcs.ICLP.2016.1},
  URN =		{urn:nbn:de:0030-drops-67321},
  doi =		{10.4230/OASIcs.ICLP.2016.1},
  annote =	{Keywords: constraint answer set programming, constraint satisfaction processing, satisfiability modulo theories}
}
Document
Theory Solving Made Easy with Clingo 5

Authors: Martin Gebser, Roland Kaminski, Benjamin Kaufmann, Max Ostrowski, Torsten Schaub, and Philipp Wanko

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


Abstract
Answer Set Programming (ASP) is a model, ground, and solve paradigm. The integration of application- or theory-specific reasoning into ASP systems thus impacts on many if not all elements of its workflow, viz. input language, grounding, intermediate language, solving, and output format. We address this challenge with the fifth generation of the ASP system clingo and its grounding and solving components by equipping them with well-defined generic interfaces facilitating the manifold integration efforts. On the grounder's side, we introduce a generic way of specifying language extensions and propose an intermediate format accommodating their ground representation. At the solver end, this is accompanied by high-level interfaces easing the integration of theory propagators dealing with these extensions.

Cite as

Martin Gebser, Roland Kaminski, Benjamin Kaufmann, Max Ostrowski, Torsten Schaub, and Philipp Wanko. Theory Solving Made Easy with Clingo 5. In Technical Communications of the 32nd International Conference on Logic Programming (ICLP 2016). Open Access Series in Informatics (OASIcs), Volume 52, pp. 2:1-2:15, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2016)


Copy BibTex To Clipboard

@InProceedings{gebser_et_al:OASIcs.ICLP.2016.2,
  author =	{Gebser, Martin and Kaminski, Roland and Kaufmann, Benjamin and Ostrowski, Max and Schaub, Torsten and Wanko, Philipp},
  title =	{{Theory Solving Made Easy with Clingo 5}},
  booktitle =	{Technical Communications of the 32nd International Conference on Logic Programming (ICLP 2016)},
  pages =	{2:1--2:15},
  series =	{Open Access Series in Informatics (OASIcs)},
  ISBN =	{978-3-95977-007-1},
  ISSN =	{2190-6807},
  year =	{2016},
  volume =	{52},
  editor =	{Carro, Manuel and King, Andy and Saeedloei, Neda and De Vos, Marina},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/OASIcs.ICLP.2016.2},
  URN =		{urn:nbn:de:0030-drops-67337},
  doi =		{10.4230/OASIcs.ICLP.2016.2},
  annote =	{Keywords: Answer Set Programming, Theory Language, Theory Propagation}
}
Document
Computing Diverse Optimal Stable Models

Authors: Javier Romero, Torsten Schaub, and Philipp Wanko

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


Abstract
We introduce a comprehensive framework for computing diverse (or similar) solutions to logic programs with preferences. Our framework provides a wide spectrum of complete and incomplete methods for solving this task. Apart from proposing several new methods, it also accommodates existing ones and generalizes them to programs with preferences. Interestingly, this is accomplished by integrating and automating several basic ASP techniques - being of general interest even beyond diversification. The enabling factor of this lies in the recent advance of multi-shot ASP solving that provides us with fine-grained control over reasoning processes and abolishes the need for solver modifications and wrappers that were indispensable in previous approaches. Our framework is implemented as an extension to the ASP-based preference handling system asprin. We use the resulting system asprin 2 for an empirical evaluation of the diversification methods comprised in our framework.

Cite as

Javier Romero, Torsten Schaub, and Philipp Wanko. Computing Diverse Optimal Stable Models. In Technical Communications of the 32nd International Conference on Logic Programming (ICLP 2016). Open Access Series in Informatics (OASIcs), Volume 52, pp. 3:1-3:14, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2016)


Copy BibTex To Clipboard

@InProceedings{romero_et_al:OASIcs.ICLP.2016.3,
  author =	{Romero, Javier and Schaub, Torsten and Wanko, Philipp},
  title =	{{Computing Diverse Optimal Stable Models}},
  booktitle =	{Technical Communications of the 32nd International Conference on Logic Programming (ICLP 2016)},
  pages =	{3:1--3:14},
  series =	{Open Access Series in Informatics (OASIcs)},
  ISBN =	{978-3-95977-007-1},
  ISSN =	{2190-6807},
  year =	{2016},
  volume =	{52},
  editor =	{Carro, Manuel and King, Andy and Saeedloei, Neda and De Vos, Marina},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/OASIcs.ICLP.2016.3},
  URN =		{urn:nbn:de:0030-drops-67348},
  doi =		{10.4230/OASIcs.ICLP.2016.3},
  annote =	{Keywords: Answer Set Programming, Diversity, Similarity, Preferences}
}
Document
Answer Set Programming for Qualitative Spatio-Temporal Reasoning: Methods and Experiments

Authors: Christopher Brenton, Wolfgang Faber, and Sotiris Batsakis

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


Abstract
We study the translation of reasoning problems involving qualitative spatio-temporal calculi into answer set programming (ASP). We present various alternative transformations and provide a qualitative comparison among them. An implementation of these transformations is provided by a tool that transforms problem instances specified in the language of the Generic Qualitative Reasoner (GQR) into ASP problems. Finally, we report on an experimental analysis of solving consistency problems for Allen's Interval Algebra and the Region Connection Calculus with eight base relations (RCC-8).

Cite as

Christopher Brenton, Wolfgang Faber, and Sotiris Batsakis. Answer Set Programming for Qualitative Spatio-Temporal Reasoning: Methods and Experiments. In Technical Communications of the 32nd International Conference on Logic Programming (ICLP 2016). Open Access Series in Informatics (OASIcs), Volume 52, pp. 4:1-4:15, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2016)


Copy BibTex To Clipboard

@InProceedings{brenton_et_al:OASIcs.ICLP.2016.4,
  author =	{Brenton, Christopher and Faber, Wolfgang and Batsakis, Sotiris},
  title =	{{Answer Set Programming for Qualitative Spatio-Temporal Reasoning: Methods and Experiments}},
  booktitle =	{Technical Communications of the 32nd International Conference on Logic Programming (ICLP 2016)},
  pages =	{4:1--4:15},
  series =	{Open Access Series in Informatics (OASIcs)},
  ISBN =	{978-3-95977-007-1},
  ISSN =	{2190-6807},
  year =	{2016},
  volume =	{52},
  editor =	{Carro, Manuel and King, Andy and Saeedloei, Neda and De Vos, Marina},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/OASIcs.ICLP.2016.4},
  URN =		{urn:nbn:de:0030-drops-67352},
  doi =		{10.4230/OASIcs.ICLP.2016.4},
  annote =	{Keywords: answer set programming, qualitative spatio-temporal reasoning}
}
Document
Rewriting Optimization Statements in Answer-Set Programs

Authors: Jori Bomanson, Martin Gebser, and Tomi Janhunen

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


Abstract
Constraints on Pseudo-Boolean (PB) expressions can be translated into Conjunctive Normal Form (CNF) using several known translations. In Answer-Set Programming (ASP), analogous expressions appear in weight rules and optimization statements. Previously, we have translated weight rules into normal rules, using normalizations designed in accord with existing CNF encodings. In this work, we rededicate such designs to rewrite optimization statements in ASP. In this context, a rewrite of an optimization statement is a replacement accompanied by a set of normal rules that together replicate the original meaning. The goal is partially the same as in translating PB constraints or weight rules: to introduce new meaningful auxiliary atoms that may help a solver in the search for (optimal) solutions. In addition to adapting previous translations, we present selective rewriting techniques in order to meet the above goal while using only a limited amount of new rules and atoms. We experimentally evaluate these methods in preprocessing ASP optimization statements and then searching for optimal answer sets. The results exhibit significant advances in terms of numbers of optimally solved instances, reductions in search conflicts, and shortened computation times. By appropriate choices of rewriting techniques, improvements are made on instances involving both small and large weights. In particular, we show that selective rewriting is paramount on benchmarks involving large weights.

Cite as

Jori Bomanson, Martin Gebser, and Tomi Janhunen. Rewriting Optimization Statements in Answer-Set Programs. In Technical Communications of the 32nd International Conference on Logic Programming (ICLP 2016). Open Access Series in Informatics (OASIcs), Volume 52, pp. 5:1-5:15, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2016)


Copy BibTex To Clipboard

@InProceedings{bomanson_et_al:OASIcs.ICLP.2016.5,
  author =	{Bomanson, Jori and Gebser, Martin and Janhunen, Tomi},
  title =	{{Rewriting Optimization Statements in Answer-Set Programs}},
  booktitle =	{Technical Communications of the 32nd International Conference on Logic Programming (ICLP 2016)},
  pages =	{5:1--5:15},
  series =	{Open Access Series in Informatics (OASIcs)},
  ISBN =	{978-3-95977-007-1},
  ISSN =	{2190-6807},
  year =	{2016},
  volume =	{52},
  editor =	{Carro, Manuel and King, Andy and Saeedloei, Neda and De Vos, Marina},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/OASIcs.ICLP.2016.5},
  URN =		{urn:nbn:de:0030-drops-67362},
  doi =		{10.4230/OASIcs.ICLP.2016.5},
  annote =	{Keywords: Answer-Set Programming, Pseudo-Boolean optimization, Translation methods}
}
Document
Justifications and Blocking Sets in a Rule-Based Answer Set Computation

Authors: Christopher Béatrix, Claire Lefèvre, Laurent Garcia, and Igor Stéphan

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


Abstract
Notions of justifications for logic programs under answer set semantics have been recently studied for atom-based approaches or argumentation approaches. The paper addresses the question in a rule-based answer set computation: the search algorithm does not guess on the truth or falsity of an atom but on the application or non application of a non monotonic rule. In this view, justifications are sets of ground rules with particular properties. Properties of these justifications are established; in particular the notion of blocking set (a reason incompatible with an answer set) is defined, that permits to explain computation failures. Backjumping, learning, debugging and explanations are possible applications.

Cite as

Christopher Béatrix, Claire Lefèvre, Laurent Garcia, and Igor Stéphan. Justifications and Blocking Sets in a Rule-Based Answer Set Computation. In Technical Communications of the 32nd International Conference on Logic Programming (ICLP 2016). Open Access Series in Informatics (OASIcs), Volume 52, pp. 6:1-6:15, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2016)


Copy BibTex To Clipboard

@InProceedings{beatrix_et_al:OASIcs.ICLP.2016.6,
  author =	{B\'{e}atrix, Christopher and Lef\`{e}vre, Claire and Garcia, Laurent and St\'{e}phan, Igor},
  title =	{{Justifications and Blocking Sets in a Rule-Based Answer Set Computation}},
  booktitle =	{Technical Communications of the 32nd International Conference on Logic Programming (ICLP 2016)},
  pages =	{6:1--6:15},
  series =	{Open Access Series in Informatics (OASIcs)},
  ISBN =	{978-3-95977-007-1},
  ISSN =	{2190-6807},
  year =	{2016},
  volume =	{52},
  editor =	{Carro, Manuel and King, Andy and Saeedloei, Neda and De Vos, Marina},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/OASIcs.ICLP.2016.6},
  URN =		{urn:nbn:de:0030-drops-67310},
  doi =		{10.4230/OASIcs.ICLP.2016.6},
  annote =	{Keywords: Answer Set Programming, Justification, Rule-based Computation}
}
Document
Intelligent Instantiation and Supersafe Rules

Authors: Vladimir Lifschitz

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


Abstract
In the input languages of most answer set solvers, a rule with variables has, conceptually, infinitely many instances. The primary role of the process of intelligent instillation is to identify a finite set of ground instances of rules of the given program that are "essential" for generating its stable models. This process can be launched only when all rules of the program are safe. If a program contains arithmetic operations or comparisons then its rules are expected to satisfy conditions that are even stronger than safety. This paper is an attempt to make the idea of an essential instance and the need for "supersafety" in the process of intelligent instantiation mathematically precise.

Cite as

Vladimir Lifschitz. Intelligent Instantiation and Supersafe Rules. In Technical Communications of the 32nd International Conference on Logic Programming (ICLP 2016). Open Access Series in Informatics (OASIcs), Volume 52, pp. 7:1-7:14, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2016)


Copy BibTex To Clipboard

@InProceedings{lifschitz:OASIcs.ICLP.2016.7,
  author =	{Lifschitz, Vladimir},
  title =	{{Intelligent Instantiation and Supersafe Rules}},
  booktitle =	{Technical Communications of the 32nd International Conference on Logic Programming (ICLP 2016)},
  pages =	{7:1--7:14},
  series =	{Open Access Series in Informatics (OASIcs)},
  ISBN =	{978-3-95977-007-1},
  ISSN =	{2190-6807},
  year =	{2016},
  volume =	{52},
  editor =	{Carro, Manuel and King, Andy and Saeedloei, Neda and De Vos, Marina},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/OASIcs.ICLP.2016.7},
  URN =		{urn:nbn:de:0030-drops-67375},
  doi =		{10.4230/OASIcs.ICLP.2016.7},
  annote =	{Keywords: answer set programming}
}
Document
An Answer Set Programming Framework for Reasoning About Truthfulness of Statements by Agents

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

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


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

Cite as

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


Copy BibTex To Clipboard

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

Authors: Martin Gebser, Roland Kaminski, Benjamin Kaufmann, Patrick Lühne, Javier Romero, and Torsten Schaub

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


Abstract
Conflict learning plays a key role in modern Boolean constraint solving. Advanced in satisfiability testing, it has meanwhile become a base technology in many neighboring fields, among them answer set programming (ASP). However, learned constraints are only valid for a currently solved problem instance and do not carry over to similar instances. We address this issue in ASP and introduce a framework featuring an integrated feedback loop that allows for reusing conflict constraints. The idea is to extract (propositional) conflict constraints, generalize and validate them, and reuse them as integrity constraints. Although we explore our approach in the context of dynamic applications based on transition systems, it is driven by the ultimate objective of overcoming the issue that learned knowledge is bound to specific problem instances. We implemented this workflow in two systems, namely, a variant of the ASP solver clasp that extracts integrity constraints along with a downstream system for generalizing and validating them.

Cite as

Martin Gebser, Roland Kaminski, Benjamin Kaufmann, Patrick Lühne, Javier Romero, and Torsten Schaub. Answer Set Solving with Generalized Learned Constraints. In Technical Communications of the 32nd International Conference on Logic Programming (ICLP 2016). Open Access Series in Informatics (OASIcs), Volume 52, pp. 9:1-9:15, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2016)


Copy BibTex To Clipboard

@InProceedings{gebser_et_al:OASIcs.ICLP.2016.9,
  author =	{Gebser, Martin and Kaminski, Roland and Kaufmann, Benjamin and L\"{u}hne, Patrick and Romero, Javier and Schaub, Torsten},
  title =	{{Answer Set Solving with Generalized Learned Constraints}},
  booktitle =	{Technical Communications of the 32nd International Conference on Logic Programming (ICLP 2016)},
  pages =	{9:1--9:15},
  series =	{Open Access Series in Informatics (OASIcs)},
  ISBN =	{978-3-95977-007-1},
  ISSN =	{2190-6807},
  year =	{2016},
  volume =	{52},
  editor =	{Carro, Manuel and King, Andy and Saeedloei, Neda and De Vos, Marina},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/OASIcs.ICLP.2016.9},
  URN =		{urn:nbn:de:0030-drops-67393},
  doi =		{10.4230/OASIcs.ICLP.2016.9},
  annote =	{Keywords: Answer Set Programming, Conflict Learning, Constraint Generalization, Generalized Constraint Feedback}
}
Document
P-rho-Log: Combining Logic Programming with Conditional Transformation Systems

Authors: Besik Dundua, Temur Kutsia, and Klaus Reisenberger-Hagmayer

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


Abstract
P-rho-Log extends Prolog by conditional transformations that are controlled by strategies. We give a brief overview of the tool and illustrate its capabilities.

Cite as

Besik Dundua, Temur Kutsia, and Klaus Reisenberger-Hagmayer. P-rho-Log: Combining Logic Programming with Conditional Transformation Systems. In Technical Communications of the 32nd International Conference on Logic Programming (ICLP 2016). Open Access Series in Informatics (OASIcs), Volume 52, pp. 10:1-10:5, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2016)


Copy BibTex To Clipboard

@InProceedings{dundua_et_al:OASIcs.ICLP.2016.10,
  author =	{Dundua, Besik and Kutsia, Temur and Reisenberger-Hagmayer, Klaus},
  title =	{{P-rho-Log: Combining Logic Programming with Conditional Transformation Systems}},
  booktitle =	{Technical Communications of the 32nd International Conference on Logic Programming (ICLP 2016)},
  pages =	{10:1--10:5},
  series =	{Open Access Series in Informatics (OASIcs)},
  ISBN =	{978-3-95977-007-1},
  ISSN =	{2190-6807},
  year =	{2016},
  volume =	{52},
  editor =	{Carro, Manuel and King, Andy and Saeedloei, Neda and De Vos, Marina},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/OASIcs.ICLP.2016.10},
  URN =		{urn:nbn:de:0030-drops-67409},
  doi =		{10.4230/OASIcs.ICLP.2016.10},
  annote =	{Keywords: Conditional transformation rules, strategies, Prolog}
}
Document
Grounded Fixpoints and Active Integrity Constraints

Authors: Luís Cruz-Filipe

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


Abstract
The formalism of active integrity constraints was introduced as a way to specify particular classes of integrity constraints over relational databases together with preferences on how to repair existing inconsistencies. The rule-based syntax of such integrity constraints also provides algorithms for finding such repairs that achieve the best asymptotic complexity. However, the different semantics that have been proposed for these integrity constraints all exhibit some counter-intuitive examples. In this work, we look at active integrity constraints using ideas from algebraic fixpoint theory. We show how database repairs can be modeled as fixpoints of particular operators on databases, and study how the notion of grounded fixpoint induces a corresponding notion of grounded database repair that captures several natural intuitions, and in particular avoids the problems of previous alternative semantics. In order to study grounded repairs in their full generality, we need to generalize the notion of grounded fixpoint to non-deterministic operators. We propose such a definition and illustrate its plausibility in the database context.

Cite as

Luís Cruz-Filipe. Grounded Fixpoints and Active Integrity Constraints. In Technical Communications of the 32nd International Conference on Logic Programming (ICLP 2016). Open Access Series in Informatics (OASIcs), Volume 52, pp. 11:1-11:14, Schloss Dagstuhl - Leibniz-Zentrum für Informatik (2016)


Copy BibTex To Clipboard

@InProceedings{cruzfilipe:OASIcs.ICLP.2016.11,
  author =	{Cruz-Filipe, Lu{\'\i}s},
  title =	{{Grounded Fixpoints and Active Integrity Constraints}},
  booktitle =	{Technical Communications of the 32nd International Conference on Logic Programming (ICLP 2016)},
  pages =	{11:1--11:14},
  series =	{Open Access Series in Informatics (OASIcs)},
  ISBN =	{978-3-95977-007-1},
  ISSN =	{2190-6807},
  year =	{2016},
  volume =	{52},
  editor =	{Carro, Manuel and King, Andy and Saeedloei, Neda and De Vos, Marina},
  publisher =	{Schloss Dagstuhl -- Leibniz-Zentrum f{\"u}r Informatik},
  address =	{Dagstuhl, Germany},
  URL =		{https://drops.dagstuhl.de/entities/document/10.4230/OASIcs.ICLP.2016.11},
  URN =		{urn:nbn:de:0030-drops-67411},
  doi =		{10.4230/OASIcs.ICLP.2016.11},
  annote =	{Keywords: grounded fixpoints, active integrity constraints}
}
  • Refine by Author
  • 3 Gebser, Martin
  • 3 Schaub, Torsten
  • 3 Wanko, Philipp
  • 2 Carro, Manuel
  • 2 De Vos, Marina
  • Show More...

  • Refine by Classification
  • 1 General and reference → Surveys and overviews
  • 1 Hardware → On-chip resource management

  • Refine by Keyword
  • 5 Answer Set Programming
  • 3 answer set programming
  • 2 Constraints
  • 2 Logic Programming
  • 1 ASP
  • Show More...

  • Refine by Type
  • 28 document
  • 1 volume

  • Refine by Publication Year
  • 27 2016
  • 1 2012
  • 1 2017

Questions / Remarks / Feedback
X

Feedback for Dagstuhl Publishing


Thanks for your feedback!

Feedback submitted

Could not send message

Please try again later or send an E-mail