1313 search results - page 25 / 263 » Prioritized Reasoning in Logic Programming |
TASE
2009
IEEE
15 years 4 months ago
2009
IEEE
—Formal verification of low-level programs often requires explicit reasoning and specification of runtime stacks. Treating stacks naively as parts of ordinary heaps can lead to...
118
click to vote
RR
2009
Springer
15 years 2 months ago
2009
Springer
In this paper we argue the case for integrating the distinctive functionalities of logic programs and production systems within an abductive logic programming agent framework. In t...
CADE
2002
Springer
15 years 10 months ago
2002
Springer
100
Voted
PPCP
1993
15 years 1 months ago
1993
Higher-order logic programming (HOLP) languages are particularly useful for various kinds of metaprogramming and theorem proving tasks because of the logical support for variable ...
101
Voted
LFCS
2007
Springer
15 years 3 months ago
2007
Springer
Abstract. In order to verify programs with pointer variables, we introduce a temporal logic LTLmem whose underlying assertion language is the quantifier-free fragment of separatio...