Sciweavers

279 search results - page 20 / 56
» Computing Intersections of Horn Theories for Reasoning with ...
Sort
View
IJCAI
1989
13 years 10 months ago
Reasoning about Kinematic Topology
t ion which is much more abstract than a place vocabulary, the kinematic topology. Kinematic topology does not define qualitative inference rules, but provides a characterization o...
Boi Faltings, Emmanuel Baechler, J. Primus
CSL
2010
Springer
13 years 10 months ago
From Feasible Proofs to Feasible Computations
We shall discuss several situations in which it is possible to extract from a proof, be it a proof in a first-order theory or a propositional proof, some feasible computational inf...
Jan Krajícek
FORMATS
2006
Springer
14 years 19 days ago
Symbolic Robustness Analysis of Timed Automata
We propose a symbolic algorithm for the analysis of the robustness of timed automata, that is the correctness of the model in presence of small drifts on the clocks or imprecision ...
Conrado Daws, Piotr Kordy
AAAI
1994
13 years 10 months ago
Learning to Reason
We introduce a new framework for the study of reasoning. The Learning (in order) to Reason approach developed here views learning as an integral part of the inference process, and ...
Roni Khardon, Dan Roth
POPL
2010
ACM
14 years 6 months ago
Dependent Types from Counterexamples
d by recent research in abstract model checking, we present a new approach to inferring dependent types. Unlike many of the existing approaches, our approach does not rely on prog...
Tachio Terauchi