121 search results - page 23 / 25 » Abduction in PDT Logic |
IJCAI
2001
13 years 11 months ago
2001
A technique is proposed for computing the weakest sufficient (wsc) and strongest necessary (snc) conditions for formulas in an expressive fragment of first-order logic using quant...
KRDB
1996
13 years 11 months ago
1996
Metaprogramming adds new expressive power to logic programming which can be advantageous to transfer to the field of deductive databases. We propose metaprogramming as a way to mo...
CORR
2008
Springer
13 years 9 months ago
2008
Springer
Requirements about the quality of clinical guidelines can be represented by schemata borrowed from the theory of abductive diagnosis, using temporal logic to model the time-orient...
JSC
2010
13 years 8 months ago
2010
We study the automated verification of pointer safety for heap-manipulating imperative programs with unknown procedure calls. Given a Hoare-style partial correctness specificati...
PADL
2009
Springer
14 years 10 months ago
2009
Springer
Abstract. For practical applications, the use of top-down query-driven proofprocedures is essential for an efficient use and computation of answers using Logic Programs as knowledg...