Sciweavers

3624 search results - page 172 / 725
» Abstract Algebraic Logic
Sort
View
ASPDAC
2005
ACM
97views Hardware» more  ASPDAC 2005»
15 years 8 months ago
Fast synthesis of exact minimal reversible circuits using group theory
- 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...
Guowu Yang, Xiaoyu Song, William N. N. Hung, Marek...
FUIN
2007
92views more  FUIN 2007»
15 years 6 months ago
Foundations of Modal Deductive Databases
We give formulations for modal deductive databases and present a modal query language called MDatalog. We define modal relational algebras and give the seminaive evaluation algor...
Linh Anh Nguyen
SYNTHESE
2008
88views more  SYNTHESE 2008»
15 years 6 months ago
Interpolation in computing science: the semantics of modularization
The Interpolation Theorem, first formulated and proved by W. Craig fifty years ago for predicate logic, has been extended to many other logical frameworks and is being applied in s...
Gerard R. Renardel de Lavalette
152
Voted
CADE
1998
Springer
15 years 10 months ago
Extensional Higher-Order Resolution
Abstract. In this paper we present an extensional higher-order resolution calculus that is complete relative to Henkin model semantics. The treatment of the extensionality principl...
Christoph Benzmüller, Michael Kohlhase
ICALP
2009
Springer
15 years 10 months ago
Boundedness of Monadic Second-Order Formulae over Finite Words
Abstract. We prove that the boundedness problem for monadic secondorder logic over the class of all finite words is decidable.
Achim Blumensath, Martin Otto, Mark Weyer