96 search results - page 15 / 20 » Solving the Satisfiability Problem Using Finite Learning Aut... |
AAAI
1990
13 years 8 months ago
1990
Current explanation-based generalization (EBG) techniques can perform badly when the problem being solved involves recursion. Often an infinite series of learned concepts are gene...
HASE
2007
IEEE
14 years 1 months ago
2007
IEEE
High assurance in embedded system software is difficult to attain. Verification relies on testing. The unreliable and costly testing process is made much worse because the softwar...
AIPS
2006
13 years 9 months ago
2006
In this paper, we propose a new approach, called lemma-reusing, for accelerating SAT based planning and scheduling. Generally, SAT based approaches generate a sequence of SAT prob...
AIR
2004
13 years 7 months ago
2004
Ensuring truthfulness amongst self-interested agents bidding against one another in an auction can be computationally expensive when prices are determined using the Vickrey-Clarke-...
EH
1999
IEEE
1999
IEEE
Evolvable Hardware or Learning Hardware? Induction of State Machines from Temporal Logic Constraints
13 years 11 months ago
Here we advocate an approach to learning hardware based on induction of finite state machines from temporal logic constraints. The method involves training on examples, constraint...