scholarly journals Teleo-Reactive Abductive Logic Programs

2012 ◽  
pp. 12-32 ◽  
Author(s):  
Robert A. Kowalski ◽  
Fariba Sadri
Keyword(s):  
Logic Programs ◽  
Abductive Logic

scholarly journals SLDNFA: An abductive procedure for abductive logic programs

1998 ◽  
Vol 34 (2) ◽  
pp. 111-167 ◽  
Author(s):  
Marc Denecker ◽  
Danny de Schreye
Keyword(s):  
Logic Programs ◽  
Abductive Logic

scholarly journals Three-valued completion for abductive logic programs

1996 ◽  
Vol 165 (1) ◽  
pp. 171-200 ◽  
Author(s):  
Frank Teusink
Keyword(s):  
Logic Programs ◽  
Abductive Logic

scholarly journals Abductive logic programs with penalization: semantics, complexity and implementation

2005 ◽  
Vol 5 (1-2) ◽  
pp. 123-159 ◽  
Author(s):  
SIMONA PERRI ◽  
FRANCESCO SCARCELLO ◽  
NICOLA LEONE
Keyword(s):  
Logic Programs ◽  
Abductive Logic

scholarly journals A fixpoint characterization of abductive logic programs

1996 ◽  
Vol 27 (2) ◽  
pp. 107-136 ◽  
Author(s):  
Katsumi Inoue ◽  
Chiaki Sakama
Keyword(s):  
Logic Programs ◽  
Abductive Logic

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.

Generalized Disjunctive Well-Founded Semantics for Logic Programs

1990 ◽  
Author(s):  
Chitta Baral ◽  
Jorge Lobo ◽  
Jack Minker
Keyword(s):  
Logic Programs
Sign in / Sign up

Export Citation Format

Share Document