579 search results - page 34 / 116 » Combined reasoning by automated cooperation |
LOPSTR
1994
Springer
15 years 1 months ago
1994
Springer
A technique for transformation of definite logic programs is presented. A first phase performs an analysis of the extended call/exit patterns of the source program. It is shown tha...
ICLP
1990
Springer
15 years 1 months ago
1990
Springer
The logic programming language framework Kernel Andorra Prolog is de ned by a formal computation model. In Kernel Andorra Prolog, general combinations of concurrent reactive langu...
105
click to vote
ASP
2001
Springer
15 years 1 months ago
2001
Springer
This paper presents a novel application of answer set programming to concept learning in nonmonotonic logic programs. Given an extended logic program as a background theory, we in...
CL
2000
Springer
15 years 1 months ago
2000
Springer
Boolean circuits offer a natural, structured, and compact representation of Boolean functions for many application domains. In this paper a tableau method for solving satisfiabilit...
CSL
2008
Springer
14 years 11 months ago
2008
Springer
We study the expressive power of the logics EF + F-1 , 2 and boolean combinations of 1 over ranked trees. In particular, we provide effective characterizations of those three logic...