1950 search results - page 223 / 390 » Lambda-Free Logical Frameworks |
179
click to vote
SLP
1994
15 years 8 months ago
1994
In this paper we explore the notion of a \signing" of a logic program, in the framework of the answer set semantics. In particular, we generalize and extend the notion of a s...
196
click to vote
IANDC
2007
15 years 6 months ago
2007
A fundamental result of Büchi states that the set of monadic second-order formulas true in the structure (Nat, <) is decidable. A natural question is: what monadic predicates ...
156
click to vote
ICPR
2008
IEEE
16 years 7 months ago
2008
IEEE
In real-world Digital Libraries, Artificial Intelligence techniques are essential for tackling the automatic document processing task with sufficient flexibility. The great variab...
292
click to vote
ECOOP
2009
Springer
16 years 7 months ago
2009
Springer
Abstract. It is common for large-scale Java applications to suffer memory problems, whether inefficient designs that impede scalability, or lifetime bugs such as leaks. Making sens...
278
click to vote
CADE
2004
Springer
16 years 6 months ago
2004
Springer
Deduction modulo is a theoretical framework for reasoning modulo a congruence on propositions. Computational steps are thus removed from proofs, thus allowing a clean separatation...