228 search results - page 20 / 46 » A Theory of Restrictions for Logics and Automata |
DATE
2004
IEEE
14 years 11 days ago
2004
IEEE
We propose an algorithm for efficient threshold network synthesis of arbitrary multi-output Boolean functions. The main purpose of this work is to bridge the wide gap that currentl...
FROCOS
2005
Springer
14 years 2 months ago
2005
Springer
In a previous paper, we have introduced a general approach for connecting two many-sorted theories through connection functions that behave like homomorphisms on the shared signatu...
CADE
2009
Springer
14 years 9 months ago
2009
Springer
Abstract. We give a method for modular generation of ground interpolants in modern SMT solvers supporting multiple theories. Our method uses a novel algorithm to modify the proof t...
LICS
2007
IEEE
14 years 2 months ago
2007
IEEE
We define a new class of languages defined by multi-stack automata that forms a robust subclass of context-sensitive languages, with decidable emptiness and closure under boolea...
WSPI
2004
13 years 10 months ago
2004
Conceptual Modeling is a discipline of great relevance to several areas in Computer Science. In a series of papers [1,2,3] we have been using the General Ontological Language (GOL)...