158 search results - page 25 / 32 » Coinductive Logic Programming with Negation |
DOOD
1991
Springer
14 years 2 days ago
1991
Springer
This paper examines the problem of adding non-deterministic constructs to a declarative database language based on Horn Clause Logic. We revise a previously proposed approach, the...
CTRS
1987
14 years 1 days ago
1987
Conditional rewriting has been studied both from the point of view of algebraic data type specifications and as a computational paradigm combining logic and functional programming...
IJCAI
2003
13 years 10 months ago
2003
In rule-based systems, goal-oriented computations correspond naturally to the possible ways that an observation may be explained. In some applications, we need to compute explanat...
ICFP
2000
ACM
14 years 28 days ago
2000
ACM
We review the close relationship between abstract machines for (call-by-name or call-by-value) λ-calculi (extended with Felleisen’s C) and sequent calculus, reintroducing on the...
IFIP
2009
Springer
13 years 6 months ago
2009
Springer
Cryptographic protocols can only be secure under certain inequality assumptions. Axiomatizing these inequalities explicitly is problematic: stating too many inequalities may impair...