76 search results - page 9 / 16 » A Tabulation Proof Procedure for Residuated Logic Programmin... |
116
click to vote
DALT
2005
Springer
15 years 3 months ago
2005
Springer
Abstract. This paper extends a programming language for implementing cognitive agents with the capability to explicitly represent beliefs and reason about them. In this programming...
LPKR
1997
Springer
15 years 2 months ago
1997
Springer
We present the system LAP (Learning Abductive Programs) that is able to learn abductive logic programs from examples and from a background abductive theory. A new type of induction...
109
click to vote
ICFP
2010
ACM
14 years 11 months ago
2010
ACM
Several recent security-typed programming languages, such as Aura, PCML5, and Fine, allow programmers to express and enforce access control and information flow policies. Most of ...
ICFP
2003
ACM
15 years 10 months ago
2003
ACM
I describe the mechanisation in HOL of some basic -calculus theory, using the axioms proposed by Gordon and Melham [4]. Using these as a foundation, I mechanised the proofs from C...
ISMVL
1999
IEEE
15 years 2 months ago
1999
IEEE
In the last years two automated reasoning techniques for clause normal form arose in which the use of labels are prominently featured: signed logic and annotated logic programming...