850 search results - page 25 / 170 » A Logic Programming Language Based on Binding Algebras |
SAS
2001
Springer
13 years 12 months ago
2001
Springer
Abstract. Logic languages based on the theory of rational, possibly infinite, trees have much appeal in that rational trees allow for faster unification (due to the omission of t...
LICS
1991
IEEE
13 years 11 months ago
1991
IEEE
When logic programming is based on the proof theory of intuitionistic logic, it is natural to allow implications in goals and in the bodies of clauses. Attempting to prove a goal ...
LPNMR
1995
Springer
13 years 11 months ago
1995
Springer
In this paper we propose a logic programming language which supports hypothetical updates together with integrity constraints. The language allows sequences of updates by sets of a...
AMAI
2008
Springer
13 years 7 months ago
2008
Springer
We introduce a knowledge representation language AC(C) extending the syntax and semantics of ASP and CR-Prolog, give some examples of its use, and present an algorithm, ACsolver, ...
TLCA
2007
Springer
14 years 1 months ago
2007
Springer
A Kripke Semantics is defined for a higher-order logic programming language with constraints, based on Church’s Theory of Types and a generic constraint formalism. Our syntactic...