191 search results - page 14 / 39 » A Reasoner for Simple Conceptual Logic Programs |
PRICAI
2000
Springer
13 years 11 months ago
2000
Springer
Defeasible logic is a simple but efficient rule-based non-monotonic logic. It has powerful implementations and shows promise to be applied in the areas of legal reasoning and the m...
PODS
2008
ACM
14 years 7 months ago
2008
ACM
The W3C Document Object Model (DOM) specifies an XML update library. DOM is written in English, and is therefore not compositional and not complete. We provide a first step toward...
ICLP
1993
Springer
13 years 11 months ago
1993
Springer
A basic requirement of declarative programming is to free the programmer from the need to manually insert control annotations into the program. Here we study the execution of logi...
ICLP
1995
Springer
13 years 11 months ago
1995
Springer
Equational theories underly many elds of computing, including functional programming, symbolic algebra, theorem proving, term rewriting and constraint solving. In this paper we sh...
ICLP
1994
Springer
13 years 11 months ago
1994
Springer
In many cases, a logic program can be divided into two parts, so that one of them, the \bottom" part, does not refer to the predicates de ned in the \top" part. The \bot...