Results 1  10
of
23
The PITA System: Tabling and Answer Subsumption for Reasoning under Uncertainty
 UNDER CONSIDERATION FOR PUBLICATION IN THEORY AND PRACTICE OF LOGIC PROGRAMMING
, 2003
"... Many real world domains require the representation of a measure of uncertainty. The most common such representation is probability, and the combination of probability with logic programs has given rise to the field of Probabilistic Logic Programming (PLP), leading to languages such as the Independen ..."
Abstract

Cited by 26 (11 self)
 Add to MetaCart
Many real world domains require the representation of a measure of uncertainty. The most common such representation is probability, and the combination of probability with logic programs has given rise to the field of Probabilistic Logic Programming (PLP), leading to languages such as the IndependentChoice Logic, Logic Programs with Annotated Disjunctions (LPADs), Problog, PRISM and others. These languages share a similar distribution semantics, and methods have been devised to translate programs between these languages. The complexity of computing the probability of queries to these general PLP programs is very high due to the need to combine the probabilities of explanations that may not be exclusive. As one alternative, the PRISM system reduces the complexity of query answering by restricting the form of programs it can evaluate. As an entirely different alternative, Possibilistic Logic Programs adopt a simpler metric of uncertainty than probability. Each of these approaches – general PLP, restricted PLP, and Possibilistic Logic Programming – can be useful in different domains depending on the form of uncertainty to be represented, on the form of programs needed to model problems, and on the scale of
The Fourth Answer Set Programming Competition
, 2013
"... Answer Set Programming is a wellestablished paradigm of declarative programming in close relationship with other declarative formalisms such as SAT Modulo Theories, Constraint Handling Rules, PDDL and many others. Since its first informal editions, ASP systems are compared in the nowadays customar ..."
Abstract

Cited by 12 (2 self)
 Add to MetaCart
(Show Context)
Answer Set Programming is a wellestablished paradigm of declarative programming in close relationship with other declarative formalisms such as SAT Modulo Theories, Constraint Handling Rules, PDDL and many others. Since its first informal editions, ASP systems are compared in the nowadays customary ASP Competition. The fourth ASP Competition, held in 2012/2013, is the sequel to previous editions and it was jointly organized by University of Calabria (Italy) and the Vienna University of Technology (Austria). Participants competed on a selected collection of benchmark problems, taken from a variety of research areas and real world applications. The Competition featured two tracks: the Model& Solve Track, held on an open problem encoding, on an open language basis, and open to any kind of system based on a declarative specification paradigm; and the System Track, held on the basis of fixed, public problem encodings, written in a standard ASP language.
Tor: Extensible search with hookable disjunction
 Principles and Practice of Declarative Programming, 14th International ACM SIGPLAN Symposium, Proceedings
, 2012
"... Horn Clause Programs have a natural depthfirst procedural semantics. However, for many programs this procedural semantics is ineffective. In order to compute useful solutions, one needs the ability to modify the search method that explores the alternative execution branches. Tor, a welldefined h ..."
Abstract

Cited by 5 (4 self)
 Add to MetaCart
(Show Context)
Horn Clause Programs have a natural depthfirst procedural semantics. However, for many programs this procedural semantics is ineffective. In order to compute useful solutions, one needs the ability to modify the search method that explores the alternative execution branches. Tor, a welldefined hook into Prolog disjunction, provides this ability. It is lightweight thanks to its library approach and efficient because it is based on program transformation. Tor is general enough to mimic searchmodifying predicates like ECLiPSe’s search/6. Moreover, Tor supports modular composition of search methods and other hooks. Our library is already provided and used as an addon to SWIProlog.
Integrative functional statistics in logic programming
"... Abstract. We present r..eal, a library that integrates the R statistical environment with Prolog. Due to R’s functional programming affinity the interface introduced has a minimalistic feel. Programs utilising the library syntax are elegant and succinct with intuitive semantics and clear integratio ..."
Abstract

Cited by 3 (2 self)
 Add to MetaCart
(Show Context)
Abstract. We present r..eal, a library that integrates the R statistical environment with Prolog. Due to R’s functional programming affinity the interface introduced has a minimalistic feel. Programs utilising the library syntax are elegant and succinct with intuitive semantics and clear integration. In effect, the library enhances logic programming with the ability to tap into the vast wealth of statistical and probabilistic reasoning available in R. The software is a useful addition to the efforts towards the integration of statistical reasoning and knowledge representation within an AI context. Furthermore it can be used to open up new application areas for logic programming and AI techniques such as bioinformatics, computational biology, text mining, psychology and neuro sciences, where R has particularly strong presence. 1
A Tabled Prolog Program for Solving Sokoban
"... Abstract. This paper presents our program in BProlog submitted to the third ASP solver competition for the Sokoban problem. This program, based on dynamic programming, treats Sokoban as a generalized shortest path problem. It divides a problem into independent subproblems and uses modedirected tab ..."
Abstract

Cited by 2 (2 self)
 Add to MetaCart
(Show Context)
Abstract. This paper presents our program in BProlog submitted to the third ASP solver competition for the Sokoban problem. This program, based on dynamic programming, treats Sokoban as a generalized shortest path problem. It divides a problem into independent subproblems and uses modedirected tabling to store subproblems and their answers. This program is very simple but quite efficient. Without use of any sophisticated domain knowledge, it easily solved 11 of the 15 instances used in the competition. 1
Heuristics Entwined with Handlers Combined From Functional Specification to Logic Programming Implementation
"... A longstanding problem in logic programming is how to cleanly separate logic and control. While solutions exist, they fall short in one of two ways: some are too intrusive, because they require significant changes to Prolog’s underlying implementation; others are lacking a clean semantic grounding. ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
(Show Context)
A longstanding problem in logic programming is how to cleanly separate logic and control. While solutions exist, they fall short in one of two ways: some are too intrusive, because they require significant changes to Prolog’s underlying implementation; others are lacking a clean semantic grounding. We resolve both of these issues in this paper. We derive a solution that is both lightweight and principled. We do so by starting from a functional specification of Prolog based on monads, and extend this with the effect handlers approach to capture the dynamic search tree as syntax. Effect handlers then express heuristics in terms of tree transformations. Moreover, we can declaratively express many heuristics as trees themselves that are combined with search problems using a generic entwining handler. Our solution is not restricted to a functional model: we show how to implement this technique as a library in Prolog by means of delimited continuations.
The SAT Compiler in BProlog
, 2013
"... Boolean satisfiability (SAT) [2], are available for solving combinatorial search problems. DP relies on memoization of solutions to subproblems to avoid redundant computations. CP uses ..."
Abstract

Cited by 1 (0 self)
 Add to MetaCart
(Show Context)
Boolean satisfiability (SAT) [2], are available for solving combinatorial search problems. DP relies on memoization of solutions to subproblems to avoid redundant computations. CP uses
BPSolver’s Solutions to the Third ASP Competition Problems
"... Continuing with its participation in the second ASP competition, BPSolver participated in the third ASP competition. There were two tracks in the third competition, namely, the System track and the Model & Solve track. While in the System track, the participating solvers competed on solving benc ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
(Show Context)
Continuing with its participation in the second ASP competition, BPSolver participated in the third ASP competition. There were two tracks in the third competition, namely, the System track and the Model & Solve track. While in the System track, the participating solvers competed on solving benchmark problems
Tor: Modular Search with Hookable Disjunction
"... Horn Clause Programs have a natural exhaustive depthfirst procedural semantics. However, for many programs this semantics is ineffective. In order to compute useful solutions, one needs the ability to modify the search method that explores the alternative execution branches. Tor, a welldefined h ..."
Abstract
 Add to MetaCart
(Show Context)
Horn Clause Programs have a natural exhaustive depthfirst procedural semantics. However, for many programs this semantics is ineffective. In order to compute useful solutions, one needs the ability to modify the search method that explores the alternative execution branches. Tor, a welldefined hook into Prolog disjunction, provides this ability. It is lightweight thanks to its library approach and efficient because it is based on program transformation. Tor is general enough to mimic searchmodifying predicates like ECLiPSe’s search/6. Moreover, Tor supports modular composition of search methods and other hooks. The Tor library is already provided and used as an addon to SWIProlog.