183 search results - page 24 / 37 » A Prolog Implementation of Kem |
149
Voted
EUROPAR
2004
Springer
15 years 9 months ago
2004
Springer
Tabling is an implementation technique that improves the declarativeness and expressiveness of Prolog by reusing answers to subgoals. The declarative nature of tabled logic program...
141
Voted
LOPSTR
2004
Springer
15 years 9 months ago
2004
Springer
This paper describes a method for proving termination of to logic programs based on abstract interpretation. The method ry-mapping pairs to abstract the relation between calls in t...
142
Voted
ILP
2003
Springer
15 years 9 months ago
2003
Springer
This work presents the application of theory revision to the design of distributed databases to automatically revise a heuristic-based algorithm (called analysis algorithm) through...
115
click to vote
HICSS
2002
IEEE
15 years 8 months ago
2002
IEEE
Currently a number of these on-line support systems for electronic contracting are under development. In this paper we develop a logical formalism to represent the content of busi...
148
click to vote
LOPSTR
2001
Springer
15 years 8 months ago
2001
Springer
In this paper we define a sequent calculus to formally specify, simulate, debug and verify security protocols. In our sequents we distinguish between the current knowledge of prin...