3385 search results - page 227 / 677 » Language, Logic, and the Brain |
195
click to vote
TABLEAUX
2009
Springer
16 years 1 months ago
2009
Springer
We see cut-free sequent systems for the basic normal modal logics formed by any combination the axioms d, t, b, 4, 5. These systems are modular in the sense that each axiom has a c...
155
click to vote
APLAS
2005
ACM
16 years 6 days ago
2005
ACM
We describe a sound method for automatically proving Hoare triples for loop-free code in Separation Logic, for certain preconditions and postconditions (symbolic heaps). The method...
168
click to vote
CP
2005
Springer
16 years 6 days ago
2005
Springer
Local search is a powerful and well-established method for solving hard combinatorial problems. Yet, until recently, it has provided very little user support, leading to time-consu...
178
click to vote
LOPSTR
2004
Springer
16 years 16 hour ago
2004
Springer
Most logic programming languages actually provide some kind of dynamic scheduling to increase the expressive power and to control execution. Input consuming derivations have been i...
166
click to vote
ICLP
2003
Springer
15 years 12 months ago
2003
Springer
Abstract. We extend Clark’s definition of a completed program and the definition of a loop formula due to Lin and Zhao to disjunctive logic programs. Our main result, generaliz...