eng
Schloss Dagstuhl – Leibniz-Zentrum für Informatik
Open Access Series in Informatics
2190-6807
2016-11-11
52
0
0
10.4230/OASIcs.ICLP.2016
article
OASIcs, Volume 52, ICLP'16, Complete Volume
Carro, Manuel
King, Andy
Saeedloei, Neda
De Vos, Marina
OASIcs, Volume 52, ICLP'16, Complete Volume
https://drops.dagstuhl.de/storage/01oasics/oasics-vol052_iclp2016/OASIcs.ICLP.2016/OASIcs.ICLP.2016.pdf
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,
eng
Schloss Dagstuhl – Leibniz-Zentrum für Informatik
Open Access Series in Informatics
2190-6807
2016-11-11
52
0:i
0:xvi
10.4230/OASIcs.ICLP.2016.0
article
Front Matter, Table of Contents, Preface, List of Authors
Carro, Manuel
King, Andy
Saeedloei, Neda
De Vos, Marina
Front Matter, Table of Contents, Preface, List of Authors
https://drops.dagstuhl.de/storage/01oasics/oasics-vol052_iclp2016/OASIcs.ICLP.2016.0/OASIcs.ICLP.2016.0.pdf
Front Matter
Table of Contents
Preface
List of Authors
eng
Schloss Dagstuhl – Leibniz-Zentrum für Informatik
Open Access Series in Informatics
2190-6807
2016-11-11
52
1:1
1:15
10.4230/OASIcs.ICLP.2016.1
article
SMT-Based Constraint Answer Set Solver EZSMT (System Description)
Susman, Benjamin
Lierler, Yuliya
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.
https://drops.dagstuhl.de/storage/01oasics/oasics-vol052_iclp2016/OASIcs.ICLP.2016.1/OASIcs.ICLP.2016.1.pdf
constraint answer set programming
constraint satisfaction processing
satisfiability modulo theories
eng
Schloss Dagstuhl – Leibniz-Zentrum für Informatik
Open Access Series in Informatics
2190-6807
2016-11-11
52
2:1
2:15
10.4230/OASIcs.ICLP.2016.2
article
Theory Solving Made Easy with Clingo 5
Gebser, Martin
Kaminski, Roland
Kaufmann, Benjamin
Ostrowski, Max
Schaub, Torsten
Wanko, Philipp
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.
https://drops.dagstuhl.de/storage/01oasics/oasics-vol052_iclp2016/OASIcs.ICLP.2016.2/OASIcs.ICLP.2016.2.pdf
Answer Set Programming
Theory Language
Theory Propagation
eng
Schloss Dagstuhl – Leibniz-Zentrum für Informatik
Open Access Series in Informatics
2190-6807
2016-11-11
52
3:1
3:14
10.4230/OASIcs.ICLP.2016.3
article
Computing Diverse Optimal Stable Models
Romero, Javier
Schaub, Torsten
Wanko, Philipp
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.
https://drops.dagstuhl.de/storage/01oasics/oasics-vol052_iclp2016/OASIcs.ICLP.2016.3/OASIcs.ICLP.2016.3.pdf
Answer Set Programming
Diversity
Similarity
Preferences
eng
Schloss Dagstuhl – Leibniz-Zentrum für Informatik
Open Access Series in Informatics
2190-6807
2016-11-11
52
4:1
4:15
10.4230/OASIcs.ICLP.2016.4
article
Answer Set Programming for Qualitative Spatio-Temporal Reasoning: Methods and Experiments
Brenton, Christopher
Faber, Wolfgang
Batsakis, Sotiris
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).
https://drops.dagstuhl.de/storage/01oasics/oasics-vol052_iclp2016/OASIcs.ICLP.2016.4/OASIcs.ICLP.2016.4.pdf
answer set programming
qualitative spatio-temporal reasoning
eng
Schloss Dagstuhl – Leibniz-Zentrum für Informatik
Open Access Series in Informatics
2190-6807
2016-11-11
52
5:1
5:15
10.4230/OASIcs.ICLP.2016.5
article
Rewriting Optimization Statements in Answer-Set Programs
Bomanson, Jori
Gebser, Martin
Janhunen, Tomi
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.
https://drops.dagstuhl.de/storage/01oasics/oasics-vol052_iclp2016/OASIcs.ICLP.2016.5/OASIcs.ICLP.2016.5.pdf
Answer-Set Programming
Pseudo-Boolean optimization
Translation methods
eng
Schloss Dagstuhl – Leibniz-Zentrum für Informatik
Open Access Series in Informatics
2190-6807
2016-11-11
52
6:1
6:15
10.4230/OASIcs.ICLP.2016.6
article
Justifications and Blocking Sets in a Rule-Based Answer Set Computation
Béatrix, Christopher
Lefèvre, Claire
Garcia, Laurent
Stéphan, Igor
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.
https://drops.dagstuhl.de/storage/01oasics/oasics-vol052_iclp2016/OASIcs.ICLP.2016.6/OASIcs.ICLP.2016.6.pdf
Answer Set Programming
Justification
Rule-based Computation
eng
Schloss Dagstuhl – Leibniz-Zentrum für Informatik
Open Access Series in Informatics
2190-6807
2016-11-11
52
7:1
7:14
10.4230/OASIcs.ICLP.2016.7
article
Intelligent Instantiation and Supersafe Rules
Lifschitz, Vladimir
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.
https://drops.dagstuhl.de/storage/01oasics/oasics-vol052_iclp2016/OASIcs.ICLP.2016.7/OASIcs.ICLP.2016.7.pdf
answer set programming
eng
Schloss Dagstuhl – Leibniz-Zentrum für Informatik
Open Access Series in Informatics
2190-6807
2016-11-11
52
8:1
8:4
10.4230/OASIcs.ICLP.2016.8
article
An Answer Set Programming Framework for Reasoning About Truthfulness of Statements by Agents
Cao Son, Tran
Pontelli, Enrico
Gelfond, Michael
Balduccini, Marcello
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.
https://drops.dagstuhl.de/storage/01oasics/oasics-vol052_iclp2016/OASIcs.ICLP.2016.8/OASIcs.ICLP.2016.8.pdf
Agents
ASP
Reasoning
Knowledge
eng
Schloss Dagstuhl – Leibniz-Zentrum für Informatik
Open Access Series in Informatics
2190-6807
2016-11-11
52
9:1
9:15
10.4230/OASIcs.ICLP.2016.9
article
Answer Set Solving with Generalized Learned Constraints
Gebser, Martin
Kaminski, Roland
Kaufmann, Benjamin
Lühne, Patrick
Romero, Javier
Schaub, Torsten
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.
https://drops.dagstuhl.de/storage/01oasics/oasics-vol052_iclp2016/OASIcs.ICLP.2016.9/OASIcs.ICLP.2016.9.pdf
Answer Set Programming
Conflict Learning
Constraint Generalization
Generalized Constraint Feedback
eng
Schloss Dagstuhl – Leibniz-Zentrum für Informatik
Open Access Series in Informatics
2190-6807
2016-11-11
52
10:1
10:5
10.4230/OASIcs.ICLP.2016.10
article
P-rho-Log: Combining Logic Programming with Conditional Transformation Systems
Dundua, Besik
Kutsia, Temur
Reisenberger-Hagmayer, Klaus
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.
https://drops.dagstuhl.de/storage/01oasics/oasics-vol052_iclp2016/OASIcs.ICLP.2016.10/OASIcs.ICLP.2016.10.pdf
Conditional transformation rules
strategies
Prolog
eng
Schloss Dagstuhl – Leibniz-Zentrum für Informatik
Open Access Series in Informatics
2190-6807
2016-11-11
52
11:1
11:14
10.4230/OASIcs.ICLP.2016.11
article
Grounded Fixpoints and Active Integrity Constraints
Cruz-Filipe, Luís
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.
https://drops.dagstuhl.de/storage/01oasics/oasics-vol052_iclp2016/OASIcs.ICLP.2016.11/OASIcs.ICLP.2016.11.pdf
grounded fixpoints
active integrity constraints
eng
Schloss Dagstuhl – Leibniz-Zentrum für Informatik
Open Access Series in Informatics
2190-6807
2016-11-11
52
12:1
12:15
10.4230/OASIcs.ICLP.2016.12
article
Constraint CNF: SAT and CSP Language Under One Roof
De Cat, Broes
Lierler, Yuliya
A new language, called constraint CNF, is proposed. It integrates propositional logic with constraints stemming from constraint programming. A family of algorithms is designed to solve problems expressed in constraint CNF. These algorithms build on techniques from both propositional satisfiability and constraint programming. The result is a uniform language and an algorithmic framework, which allow us to gain a deeper understanding of the relation between the solving techniques used in propositional satisfiability and in constraint programming and apply them together.
https://drops.dagstuhl.de/storage/01oasics/oasics-vol052_iclp2016/OASIcs.ICLP.2016.12/OASIcs.ICLP.2016.12.pdf
Propositional Satisfiability
Constraint Programming
eng
Schloss Dagstuhl – Leibniz-Zentrum für Informatik
Open Access Series in Informatics
2190-6807
2016-11-11
52
13:1
13:14
10.4230/OASIcs.ICLP.2016.13
article
Constraint Propagation and Explanation over Novel Types by Abstract Compilation
Gange, Graeme
Stuckey, Peter J.
The appeal of constraint programming (CP) lies in compositionality – the ability to mix and match constraints as needed. However, this flexibility typically does not extend to the types of variables. Solvers usually support only a small set of pre-defined variable types, and extending this is not typically a simple exercise: not only must the solver engine be updated, but then the library of supported constraints must be re-implemented to support the new type.
In this paper, we attempt to ease this second step. We describe a system for automatically deriving a native-code implementation of a global constraint (over novel variable types) from a declarative specification, complete with the ability to explain its propagation, a requirement if we want to make use of modern lazy clause generation CP solvers.
We demonstrate this approach by adding support for wrapped-integer variables to chuffed, a lazy clause generation CP solver.
https://drops.dagstuhl.de/storage/01oasics/oasics-vol052_iclp2016/OASIcs.ICLP.2016.13/OASIcs.ICLP.2016.13.pdf
constraint programming
program synthesis
program analysis
eng
Schloss Dagstuhl – Leibniz-Zentrum für Informatik
Open Access Series in Informatics
2190-6807
2016-11-11
52
14:1
14:13
10.4230/OASIcs.ICLP.2016.14
article
A Compositional Typed Higher-Order Logic with Definitions
Dasseville, Ingmar
van der Hallen, Matthias
Bogaerts, Bart
Janssens, Gerda
Denecker, Marc
Expressive KR languages are built by integrating different language constructs, or extending a language with new language constructs. This process is difficult if non-truth-functional or non-monotonic constructs are involved. What is needed is a compositional principle.
This paper presents a compositional principle for defining logics by modular composition of logical constructs, and applies it to build a higher order logic integrating typed lambda calculus and rule sets under a well-founded or stable semantics. Logical constructs are formalized as triples of a syntactical rule, a semantical rule, and a typing rule. The paper describes how syntax, typing and semantics of the logic are composed from the set of its language constructs. The base semantical concept is the infon: mappings from structures to values in these structures. Semantical operators of language constructs operate on infons and allow to construct the infons of compound expressions from the infons of its subexpressions. This conforms to Frege's principle of compositionality.
https://drops.dagstuhl.de/storage/01oasics/oasics-vol052_iclp2016/OASIcs.ICLP.2016.14/OASIcs.ICLP.2016.14.pdf
Logic
Semantics
Compositionality
eng
Schloss Dagstuhl – Leibniz-Zentrum für Informatik
Open Access Series in Informatics
2190-6807
2016-11-11
52
15:1
15:15
10.4230/OASIcs.ICLP.2016.15
article
Inference in Probabilistic Logic Programs Using Lifted Explanations
Nampally, Arun
Ramakrishnan, C. R.
In this paper, we consider the problem of lifted inference in the context of Prism-like probabilistic logic programming languages. Traditional inference in such languages involves the construction of an explanation graph for the query that treats each instance of a random variable separately. For many programs and queries, we observe that explanations can be summarized into substantially more compact structures introduced in this paper, called "lifted explanation graph". In contrast to existing lifted inference techniques, our method for constructing lifted explanations naturally generalizes existing methods for constructing explanation graphs. To compute probability of query answers, we solve recurrences generated from the lifted graphs. We show examples where the use of our technique reduces the asymptotic complexity of inference.
https://drops.dagstuhl.de/storage/01oasics/oasics-vol052_iclp2016/OASIcs.ICLP.2016.15/OASIcs.ICLP.2016.15.pdf
Probabilistic logic programs
Probabilistic inference
Lifted inference
Symbolic evaluation
Constraints
eng
Schloss Dagstuhl – Leibniz-Zentrum für Informatik
Open Access Series in Informatics
2190-6807
2016-11-11
52
16:1
16:12
10.4230/OASIcs.ICLP.2016.16
article
On the Expressiveness of Spatial Constraint Systems
Guzmán, Michell
Valencia, Frank D.
In this paper we shall report on our progress using spatial constraint system as an abstract representation of modal and epistemic behaviour. First we shall give an introduction as well as the background to our work. Then, we present our preliminary results on the representation of modal behaviour by using spatial constraint systems. Then, we present our ongoing work on the characterization of the epistemic notion of knowledge. Finally, we discuss about the future work of our research.
https://drops.dagstuhl.de/storage/01oasics/oasics-vol052_iclp2016/OASIcs.ICLP.2016.16/OASIcs.ICLP.2016.16.pdf
Epistemic logic
Modal logic
Constraint systems
Concurrent constraint programming
eng
Schloss Dagstuhl – Leibniz-Zentrum für Informatik
Open Access Series in Informatics
2190-6807
2016-11-11
52
17:1
17:8
10.4230/OASIcs.ICLP.2016.17
article
Tabled CLP for Reasoning Over Stream Data
Arias, Joaquín
The interest in reasoning over stream data is growing as quickly as the amount of data generated. Our intention is to change the way stream data is analyzed. This is an important problem because we constantly have new sensors collecting information, new events from electronic devices and/or from customers and we want to reason about this information. For example, information about traffic jams and costumer order could be used to define a deliverer route. When there is a new order or a new traffic jam, we usually restart from scratch in order to recompute the route. However, if we have several deliveries and we analyze the information from thousands of sensors, we would like to reduce the computation requirements, e.g. reusing results from the previous computation. Nowadays, most of the applications that analyze stream data are specialized for specific problems (using complex algorithms and heuristics) and combine a computation language with a query language. As a result, when the problems become more complex (in e.g. reasoning requirements), in order to modify the application complex and error prone coding is required.
We propose a framework based on a high-level language rooted in logic and constraints that will be able to provide customized services to different problems. The framework will discard wrong solutions in early stages and will reuse previous results that are still consistent with the current data set. The use of a constraint logic programming language will make it easier to translate the problem requirements into the code and will minimize the amount of re-engineering needed to comply with the requirements when they change.
https://drops.dagstuhl.de/storage/01oasics/oasics-vol052_iclp2016/OASIcs.ICLP.2016.17/OASIcs.ICLP.2016.17.pdf
logic
languages
tabling
constraints
graph
analysis
reasoning
eng
Schloss Dagstuhl – Leibniz-Zentrum für Informatik
Open Access Series in Informatics
2190-6807
2016-11-11
52
18:1
18:5
10.4230/OASIcs.ICLP.2016.18
article
Testing of Concurrent Programs
Isabel, Miguel
Testing concurrent systems requires exploring all possible non-deterministic interleavings that the concurrent execution may have, as any of the interleavings may reveal erroneous behaviour. This introduces a new problem: the well-known state space problem, which is often computationally intractable. In the present thesis, this issue will be addressed through: (1) the development of new Partial-Order Reduction Techniques and (2) the combination of static analysis and testing (property-based testing) in order to reduce the combinatorial explosion. As a preliminary result, we have performed an experimental evaluation on the SYCO tool, a CLP-based testing framework for actor-based concurrency, where these techniques have been implemented. Finally, our experiments prove the effectiveness and applicability of the proposed techniques.
https://drops.dagstuhl.de/storage/01oasics/oasics-vol052_iclp2016/OASIcs.ICLP.2016.18/OASIcs.ICLP.2016.18.pdf
Property-based Testing
Partial Order Reduction
Deadlock-Guided Testing
Deadlock Detection
Systematic Testing
eng
Schloss Dagstuhl – Leibniz-Zentrum für Informatik
Open Access Series in Informatics
2190-6807
2016-11-11
52
19:1
19:10
10.4230/OASIcs.ICLP.2016.19
article
Controlled Natural Languages for Knowledge Representation and Reasoning
Gao, Tiantian
Controlled natural languages (CNLs) are effective languages for knowledge representation and reasoning. They are designed based on certain natural languages with restricted lexicon and grammar. CNLs are unambiguous and simple as opposed to their base languages. They preserve the expressiveness and coherence of natural languages. In this paper, it mainly focuses on a class of CNLs, called machine-oriented CNLs, which have well-defined semantics that can be deterministically translated into formal languages to do logical reasoning. Although a number of machine-oriented CNLs emerged and have been used in many application domains for problem solving and question answering, there are still many limitations: First, CNLs cannot handle inconsistencies in the knowledge base. Second, CNLs are not powerful enough to identify different variations of a sentence and therefore might not return the expected inference results. Third, CNLs do not have a good mechanism for defeasible reasoning. This paper addresses these three problems and proposes a research plan for solving these problems. It also shows the current state of research: a paraconsistent logical framework from which six principles that guide the user to encode CNL sentences were created. Experiment results show this paraconsistent logical framework and these six principles can consistently and effectively solve word puzzles with injections of inconsistencies.
https://drops.dagstuhl.de/storage/01oasics/oasics-vol052_iclp2016/OASIcs.ICLP.2016.19/OASIcs.ICLP.2016.19.pdf
Controlled Natural Languages
Paraconsistent Logics
Defeasible Reasoning
eng
Schloss Dagstuhl – Leibniz-Zentrum für Informatik
Open Access Series in Informatics
2190-6807
2016-11-11
52
20:1
20:8
10.4230/OASIcs.ICLP.2016.20
article
The Functional Perspective on Advanced Logic Programming
Vandenbroucke, Alexander
The basics of logic programming, as embodied by Prolog, are generally well-known in the programming language community. However, more advanced techniques, such as tabling, answer subsumption and probabilistic logic programming fail to attract the attention of a larger audience. The cause for the community's seemingly limited interest lies with the presentation of these features: the literature frequently focuses on implementations and examples that do little to aid the understanding of non-experts in the field. The key point is that many of these advanced logic programming features can be characterised in more generally known, more accessible terms. In my research I try to reconcile these advanced concepts from logic programming (Tabling, Answer subsumption and probabilistic programming) with concepts from functional programming (effects, monads and applicative functors).
https://drops.dagstuhl.de/storage/01oasics/oasics-vol052_iclp2016/OASIcs.ICLP.2016.20/OASIcs.ICLP.2016.20.pdf
Tabling
Answer Subsumption
Effect Handlers
Functional Programming
Logic Programming
Probabilistic Programming
eng
Schloss Dagstuhl – Leibniz-Zentrum für Informatik
Open Access Series in Informatics
2190-6807
2016-11-11
52
21:1
21:6
10.4230/OASIcs.ICLP.2016.21
article
Methods for Solving Extremal Problems in Practice
Frank, Michael
During the 20 th century there has been an incredible progress in solving theoretically hard problems in practice. One of the most prominent examples is the DPLL algorithm and its derivatives to solve the Boolean satisfiability problem, which can handle instances with millions of variables and clauses in reasonable time, notwithstanding the theoretical difficulty of solving the problem.
Despite this progress, there are classes of problems that contain especially hard instances, which have remained open for decades despite their relative small size. One such class is the class of extremal problems, which typically involve finding a combinatorial object under some constraints (e.g, the search for Ramsey numbers). In recent years, a number of specialized methods have emerged to tackle extremal problems. Most of these methods are applied to a specific problem, despite the fact there is a great deal in common between different problems.
Following a meticulous examination of these methods, we would like to extend them to handle general extremal problems. Further more, we would like to offer ways to exploit the general structure of extremal problems in order to develop constraints and symmetry breaking techniques which will, hopefully, improve existing tools. The latter point is of immense importance in the context of extremal problems, which often hamper existing tools when there is a great deal of symmetry in the search space, or when not enough is known of the problem structure. For example, if a graph is a solution to a problem instance, in many cases any isomorphic graph will also be a solution. In such cases, existing methods can usually be applied only if the model excludes symmetries.
https://drops.dagstuhl.de/storage/01oasics/oasics-vol052_iclp2016/OASIcs.ICLP.2016.21/OASIcs.ICLP.2016.21.pdf
Extremal Problems
Constraints
SAT Solving
Logic Programming
Parallelism
eng
Schloss Dagstuhl – Leibniz-Zentrum für Informatik
Open Access Series in Informatics
2190-6807
2016-11-11
52
22:1
22:10
10.4230/OASIcs.ICLP.2016.22
article
Automating Disease Management Using Answer Set Programming
Chen, Zhuo
Management of chronic diseases such as heart failure, diabetes, and chronic obstructive pulmonary disease (COPD) is a major problem in health care. A standard approach that the medical community has devised to manage widely prevalent chronic diseases such as chronic heart failure (CHF) is to have a committee of experts develop guidelines that all physicians should follow. These guidelines typically consist of a series of complex rules that make recommendations based on a patient's information. Due to their complexity, often the guidelines are either ignored or not complied with at all, which can result in poor medical practices. It is not even clear whether it is humanly possible to follow these guidelines due to their length and complexity. In the case of CHF management, the guidelines run nearly 80 pages. In this paper we describe a physician-advisory system for CHF management that codes the entire set of clinical practice guidelines for CHF using answer set programming. Our approach is based on developing reasoning templates (that we call knowledge patterns) and using these patterns to systemically code the clinical guidelines for CHF as ASP rules. Use of the knowledge patterns greatly facilitates the development of our system. Given a patient's medical information, our system generates a recommendation for treatment just as a human physician would, using the guidelines. Our system will work even in the presence of incomplete information. Our work makes two contributions: (i) it shows that highly complex guidelines can be successfully coded as ASP rules, and (ii) it develops a series of knowledge patterns that facilitate the coding of knowledge expressed in a natural language and that can be used for other application domains.
https://drops.dagstuhl.de/storage/01oasics/oasics-vol052_iclp2016/OASIcs.ICLP.2016.22/OASIcs.ICLP.2016.22.pdf
chronic disease management
knowledge pattern
answer set programming
knowledge representation
automated reasoning
eng
Schloss Dagstuhl – Leibniz-Zentrum für Informatik
Open Access Series in Informatics
2190-6807
2016-11-11
52
23:1
23:11
10.4230/OASIcs.ICLP.2016.23
article
Scalable Design Space Exploration via Answer Set Programming
Wanko, Philipp
The design of embedded systems is becoming continuously more complex such that the application of efficient high level design methods are crucial for competitive results regarding design time and performance. Recently, advances in Boolean constraint solvers for Answer Set Programming (ASP) allow for easy integration of background theories and more control over the solving process. The goal of this research is to leverage those advances for system level design space exploration while using specialized techniques from electronic design automation that drive new application-originated ideas for multi-objective combinatorial optimization.
https://drops.dagstuhl.de/storage/01oasics/oasics-vol052_iclp2016/OASIcs.ICLP.2016.23/OASIcs.ICLP.2016.23.pdf
Answer Set Programming
System Synthesis
Multi-Objective Optimization