Results 1  10
of
43,715
The Emptiness Problem of One Binary Recursive Horn Clause is Undecidable
, 1993
"... The simplest recursive program in Horn clause languages is of the form : 8 ? ! ? : p(fact) / : p(lef t) / p(right) : / p(goal) : This corresponds to appendlike programs. The two most relevant problems concerning this class are the halting and the emptiness (existence of at least one solution) prob ..."
Abstract
 Add to MetaCart
The simplest recursive program in Horn clause languages is of the form : 8 ? ! ? : p(fact) / : p(lef t) / p(right) : / p(goal) : This corresponds to appendlike programs. The two most relevant problems concerning this class are the halting and the emptiness (existence of at least one solution
Halting Problem of One Binary Horn Clause is Undecidable.
, 1993
"... . This paper proposes a codification of the halting problem of any Turing machine in the form of only one rightlinear binary Horn clause as follows : p(t) / p(tt) : where t (resp. tt) is any (resp. linear) term. Recursivity is wellknown to be a crucial and fundamental concept in programming th ..."
Abstract

Cited by 11 (0 self)
 Add to MetaCart
. This paper proposes a codification of the halting problem of any Turing machine in the form of only one rightlinear binary Horn clause as follows : p(t) / p(tt) : where t (resp. tt) is any (resp. linear) term. Recursivity is wellknown to be a crucial and fundamental concept in programming
A Transformation System for Developing Recursive Programs
, 1977
"... A system of rules for transforming programs is described, with the programs in the form of recursion equations An initially very simple, lucid. and hopefully correct program IS transformed into a more efficient one by altering the recursion structure Illustrative examples of program transformations ..."
Abstract

Cited by 653 (3 self)
 Add to MetaCart
A system of rules for transforming programs is described, with the programs in the form of recursion equations An initially very simple, lucid. and hopefully correct program IS transformed into a more efficient one by altering the recursion structure Illustrative examples of program transformations
Domain Theory
 Handbook of Logic in Computer Science
, 1994
"... Least fixpoints as meanings of recursive definitions. ..."
Abstract

Cited by 546 (25 self)
 Add to MetaCart
Least fixpoints as meanings of recursive definitions.
Undecidability of the Horn Clause Finite Implication Problem
, 1995
"... We prove that the set IMPL of such pairs ! H;G ? of Horn clauses, that H finitely implies G (i.e. G is true in all the finite structures in which H is true), is not recursive. Moreover, we prove that sets coIMPL and RES=f! H;G ? G can be derived from H by resolution g are recursively inseparable. ..."
Abstract
 Add to MetaCart
We prove that the set IMPL of such pairs ! H;G ? of Horn clauses, that H finitely implies G (i.e. G is true in all the finite structures in which H is true), is not recursive. Moreover, we prove that sets coIMPL and RES=f! H;G ? G can be derived from H by resolution g are recursively inseparable
Recursive Distributed Representations
 Artificial Intelligence
, 1990
"... A longstanding difficulty for connectionist modeling has been how to represent variablesized recursive data structures, such as trees and lists, in fixedwidth patterns. This paper presents a connectionist architecture which automatically develops compact distributed representations for such compo ..."
Abstract

Cited by 409 (9 self)
 Add to MetaCart
A longstanding difficulty for connectionist modeling has been how to represent variablesized recursive data structures, such as trees and lists, in fixedwidth patterns. This paper presents a connectionist architecture which automatically develops compact distributed representations
AgentSpeak(L): BDI Agents speak out in a logical computable language
, 1996
"... BeliefDesireIntention (BDI) agents have been investigated by many researchers from both a theoretical specification perspective and a practical design perspective. However, there still remains a large gap between theory and practice. The main reason for this has been the complexity of theoremprov ..."
Abstract

Cited by 509 (2 self)
 Add to MetaCart
theoretic semantics of a language AgentSpeak(L). This language can be viewed as an abstraction of one of the implemented BDI systems (i.e., PRS) and allows agent programs to be written and interpreted in a manner similar to that of hornclause logic programs. We show how to perform derivations in this logic using a
Parametric Shape Analysis via 3Valued Logic
, 2001
"... Shape Analysis concerns the problem of determining "shape invariants"... ..."
Abstract

Cited by 660 (79 self)
 Add to MetaCart
Shape Analysis concerns the problem of determining "shape invariants"...
One Binary Horn Clause is Enough
 PROCEEDINGS OF THE SYMPOSIUM ON THEORETICAL ASPECTS OF COMPUTER SCIENCE
, 1994
"... This paper proposes an equivalent form of the famous BöhmJacopini theorem for declarative languages. C. Böhm and G. Jacopini [1] proved that all programming can be done with at most one single whiledo. That result ..."
Abstract

Cited by 1 (1 self)
 Add to MetaCart
This paper proposes an equivalent form of the famous BöhmJacopini theorem for declarative languages. C. Böhm and G. Jacopini [1] proved that all programming can be done with at most one single whiledo. That result
Results 1  10
of
43,715