4573 search results - page 707 / 915 » Automated Reasoning |
107
Voted
KR
2004
Springer
15 years 9 months ago
2004
Springer
We describe a technique for speeding up inference for model-based abduction tasks that trades off inference time and/or space for the fraction of queries correctly answered. We co...
140
Voted
LOPSTR
2004
Springer
15 years 9 months ago
2004
Springer
This paper describes a method for proving termination of to logic programs based on abstract interpretation. The method ry-mapping pairs to abstract the relation between calls in t...
141
Voted
LPAR
2004
Springer
15 years 9 months ago
2004
Springer
Abstract. To produce a program guaranteed to satisfy a given specification one can synthesize it from a formal constructive proof that a computation satisfying that specification...
120
Voted
LPAR
2004
Springer
15 years 9 months ago
2004
Springer
Abstract. We provide uniform and invertible logical rules in a framework of relational hypersequents for the three fundamental t-norm based fuzzy logics i.e., Łukasiewicz logic, G...
132
Voted
LPAR
2004
Springer
15 years 9 months ago
2004
Springer
Abstract. The inverse method, due to Maslov, is a forward theorem proving method for cut-free sequent calculi that relies on the subformula property. The Logic of Bunched Implicati...