3566 search results - page 322 / 714 » Signed Logic Programs |
127
click to vote
CSL
2004
Springer
15 years 8 months ago
2004
Springer
To reason effectively about programs, it is important to have some version of a transitive-closure operator so that we can describe such notions as the set of nodes reachable from ...
253
click to vote
EH
1999
IEEE
1999
IEEE
Evolvable Hardware or Learning Hardware? Induction of State Machines from Temporal Logic Constraints
15 years 7 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...
131
click to vote
CIE
2005
Springer
15 years 9 months ago
2005
Springer
L APPROACH TO ABSTRACT ALGEBRA THIERRY COQUAND AND HENRI LOMBARDI Recent work in constructive mathematics show that Hilbert’s program works rge part of abstract algebra. Using in...
153
Voted
TYPES
2000
Springer
15 years 7 months ago
2000
Springer
We report on the design of a prototyping component for the theorem prover Isabelle/HOL. Specifications consisting of datatypes, recursive functions and inductive definitions are co...
149
click to vote
ICALP
2000
Springer
15 years 7 months ago
2000
Springer
Abstract. Tree-walking automata (TWAs) recently received new attention in the fields of formal languages and databases. Towards a better understanding of their expressiveness, we c...