Sciweavers

799 search results - page 80 / 160
» A Logic for Abstract State Machines
Sort
View
CADE
2002
Springer
15 years 10 months ago
Lazy Theorem Proving for Bounded Model Checking over Infinite Domains
Abstract. We investigate the combination of propositional SAT checkers with domain-specific theorem provers as a foundation for bounded model checking over infinite domains. Given ...
Harald Rueß, Leonardo Mendonça de Mou...
ICML
2004
IEEE
15 years 10 months ago
Relational sequential inference with reliable observations
We present a trainable sequential-inference technique for processes with large state and observation spaces and relational structure. Our method assumes "reliable observation...
Alan Fern, Robert Givan
IJCAI
1993
14 years 11 months ago
A New Logical framework for Deductive Planning
objects, like elements of (abstract) data types in ordinary programming languages In the theory of abstract data types most often one only considers algebraic structures where all ...
Werner Stephan, Susanne Biundo
ECML
2006
Springer
15 years 1 months ago
An Efficient Approximation to Lookahead in Relational Learners
Abstract. Greedy machine learning algorithms suffer from shortsightedness, potentially returning suboptimal models due to limited exploration of the search space. Greedy search mis...
Jan Struyf, Jesse Davis, C. David Page Jr.
FSKD
2007
Springer
277views Fuzzy Logic» more  FSKD 2007»
15 years 4 months ago
Autonomous Robot Control Using Evidential Reasoning
Evidence theory has been widely applied to uncertainty reasoning. In this paper a finite state machine with evidential reasoning is proposed to control autonomous robots. The Khep...
Qingxiang Wu, David A. Bell, Rashid Hafeez Khokhar...