CONCURRENT ABDUCTIVE LOGIC PROGRAMMING IN PANDORA

2001 ◽  
Vol 10 (03) ◽  
pp. 387-406
Author(s):  
REEM BAHGAT ◽  
OSAMA MOSTAFA ◽  
GEORGE A. PAPADOPOULOS
Keyword(s):  
Logic Programming ◽  
Logic Program ◽  
The Other ◽  
Logic Programs ◽  
Hypothetical Reasoning ◽  
Concurrent Logic Programming ◽  
Programming Technique ◽  
Abductive Logic ◽  
Abductive Logic Programming ◽  
Distributed Execution

The extension of logic programming with abduction (ALP) allows a form of hypothetical reasoning. The advantages of abduction lie in the ability to reason with incomplete information and the enhancement of the declarative representation of problems. On the other hand, concurrent logic programming is a framework which explores AND-parallelism and/or OR-parallelism in logic programs in order to efficiently execute them on multi-processor / distributed machines. The aim of our work is to study a way to model abduction within the framework of concurrent logic programming, thus taking advantage of the latter's potential for parallel and/or distributed execution. In particular, we describe Abductive Pandora, a syntactic sugar on top of the concurrent logic programming language Pandora, which provides the user with an abductive behavior for a concurrent logic program. Abductive Pandora programs are then transformed into Pandora programs which support the concurrent abductive behavior through a simple programming technique while at the same time taking advantage of the underlying Pandora machine infrastructure.

Legal Reasoning Using Abductive Logic Programming

1997 ◽  
Vol 1 (2) ◽  
pp. 114-120
Author(s):  
Takashi Kanai ◽  
◽  
Susumu Kunifuji
Keyword(s):  
Logic Programming ◽  
Knowledge Base ◽  
Legal Reasoning ◽  
The Other ◽  
Abductive Logic ◽  
Reasoning System ◽  
Abductive Logic Programming ◽  
Reasoning Systems ◽  
Legal Arguments

In this paper, we propose a new legal reasoning system using abductive logic programming (ALP). The system can deal with ambiguities of described facts and exceptions which is not described in relevant articles. In addition, the goal, queried to a legal reasoning system, differs in compliance with whether the user is a plaintiff or defendant. In usual deductive legal reasoning systems, there are two major problems in treating legal arguments. One is that legal facts usually have ambiguities, and the other is that two conflicting conclusions must be derived from one knowledge base, depending on whether a plaintiff of defendant is involved. To overcome these difficulties, abductive logic programming is used in our legal reasoning system, which can deal with implicit exceptions and generate presumptions according to the user’s needs.

scholarly journals On the Equivalence between Assumption-Based Argumentation and Logic Programming

2017 ◽  
Vol 60 ◽  
pp. 779-825 ◽  
Author(s):  
Martin Caminada ◽  
Claudia Schulz
Keyword(s):  
Logic Programming ◽  
Logic Program ◽  
The Other ◽  
Logic Programs ◽  
Special Cases ◽  
Reverse Translation ◽  
Normal Logic ◽  
The Relationship

Assumption-Based Argumentation (ABA) has been shown to subsume various other non-monotonic reasoning formalisms, among them normal logic programming (LP). We re-examine the relationship between ABA and LP and show that normal LP also subsumes (flat) ABA. More precisely, we specify a procedure that given a (flat) ABA framework yields an associated logic program with almost the same syntax whose semantics coincide with those of the ABA framework. That is, the 3-valued stable (respectively well-founded, regular, 2-valued stable, and ideal) models of the associated logic program coincide with the complete (respectively grounded, preferred, stable, and ideal) assumption labellings and extensions of the ABA framework. Moreover, we show how our results on the translation from ABA to LP can be reapplied for a reverse translation from LP to ABA, and observe that some of the existing results in the literature are in fact special cases of our work. Overall, we show that (flat) ABA frameworks can be seen as normal logic programs with a slightly different syntax. This implies that methods developed for one of these formalisms can be equivalently applied to the other by simply modifying the syntax.

Security Protocols Verification in Abductive Logic Programming: A Case Study

2006 ◽  
pp. 106-124 ◽  
Author(s):  
Marco Alberti ◽  
Federico Chesani ◽  
Marco Gavanelli ◽  
Evelina Lamma ◽  
Paola Mello ◽  
...  
Keyword(s):  
Logic Programming ◽  
Security Protocols ◽  
Abductive Logic ◽  
Abductive Logic Programming

Accountable Protocols in Abductive Logic Programming

2018 ◽  
Vol 18 (4) ◽  
pp. 1-20 ◽  
Author(s):  
Marco Gavanelli ◽  
Marco Alberti ◽  
Evelina Lamma
Keyword(s):  
Logic Programming ◽  
Abductive Logic ◽  
Abductive Logic Programming

scholarly journals Productive corecursion in logic programming

2017 ◽  
Vol 17 (5-6) ◽  
pp. 906-923 ◽  
Author(s):  
EKATERINA KOMENDANTSKAYA ◽  
YUE LI
Keyword(s):  
Data Structure ◽  
Logic Programming ◽  
State Of The Art ◽  
Logic Program ◽  
Stream Processing ◽  
The Internet ◽  
Logic Programs ◽  
Algorithmic Solution ◽  
Undecidable Property ◽  
Turing Complete

AbstractLogic Programming is a Turing complete language. As a consequence, designing algorithms that decide termination and non-termination of programs or decide inductive/coinductive soundness of formulae is a challenging task. For example, the existing state-of-the-art algorithms can only semi-decide coinductive soundness of queries in logic programming for regular formulae. Another, less famous, but equally fundamental and important undecidable property is productivity. If a derivation is infinite and coinductively sound, we may ask whether the computed answer it determines actually computes an infinite formula. If it does, the infinite computation is productive. This intuition was first expressed under the name of computations at infinity in the 80s. In modern days of the Internet and stream processing, its importance lies in connection to infinite data structure processing. Recently, an algorithm was presented that semi-decides a weaker property – of productivity of logic programs. A logic program is productive if it can give rise to productive derivations. In this paper, we strengthen these recent results. We propose a method that semi-decides productivity of individual derivations for regular formulae. Thus, we at last give an algorithmic counterpart to the notion of productivity of derivations in logic programming. This is the first algorithmic solution to the problem since it was raised more than 30 years ago. We also present an implementation of this algorithm.

scholarly journals Optimizing Answer Set Computation via Heuristic-Based Decomposition

2019 ◽  
Vol 19 (04) ◽  
pp. 603-628 ◽  
Author(s):  
FRANCESCO CALIMERI ◽  
SIMONA PERRI ◽  
JESSICA ZANGARI
Keyword(s):  
Logic Programming ◽  
Logic Program ◽  
Answer Set Programming ◽  
Decomposition Techniques ◽  
Logic Programs ◽  
Experimental Activity ◽  
Performance Of Systems ◽  
Answer Sets ◽  
The Impact ◽  
Answer Set

AbstractAnswer Set Programming (ASP) is a purely declarative formalism developed in the field of logic programming and non-monotonic reasoning: computational problems are encoded by logic programs whose answer sets, corresponding to solutions, are computed by an ASP system. Different, semantically equivalent, programs can be defined for the same problem; however, performance of systems evaluating them might significantly vary. We propose an approach for automatically transforming an input logic program into an equivalent one that can be evaluated more efficiently. One can make use of existing tree-decomposition techniques for rewriting selected rules into a set of multiple ones; the idea is to guide and adaptively apply them on the basis of proper new heuristics, to obtain a smart rewriting algorithm to be integrated into an ASP system. The method is rather general: it can be adapted to any system and implement different preference policies. Furthermore, we define a set of new heuristics tailored at optimizing grounding, one of the main phases of the ASP computation; we use them in order to implement the approach into the ASP systemDLV, in particular into its grounding subsystemℐ-DLV, and carry out an extensive experimental activity for assessing the impact of the proposal.

Sign in / Sign up

Export Citation Format

Share Document