207 search results - page 9 / 42 » Synthesizing Switching Logic Using Constraint Solving |
101
click to vote
HYBRID
2001
Springer
15 years 4 months ago
2001
Springer
Abstract. In this paper, we formulate and robustly solve a quite general class of hybrid controller synthesis problems. The type of controller we investigate is the switching contr...
ASPDAC
2005
ACM
15 years 1 months ago
2005
ACM
- We present fast algorithms to synthesize exact minimal reversible circuits for various types of gates and costs. By reducing reversible logic synthesis problems to group theory p...
108
click to vote
AGP
1999
IEEE
15 years 4 months ago
1999
IEEE
Disunification is the problem of deciding satisfiability of a system of equations and disequations with respect to a given equational theory. In this paper we study the disunifica...
116
Voted
WLP
2004
Springer
15 years 5 months ago
2004
Springer
Constraint programming provides a declarative approach to solving combinatorial (optimization) problems. The user just states the problem as a constraint satisfaction problem (CSP)...
90
Voted
ICAI
2004
15 years 1 months ago
2004
This paper shows how to generate an English step-by-step explanation that describes how an automated reasoning system solves a complex logic program. We limit our attention to pro...