Sciweavers

20 search results - page 1 / 4
» Extracting Logic Circuit Structure from Conjunctive Normal F...
Sort
View
VLSID
2007
IEEE
153views VLSI» more  VLSID 2007»
14 years 5 months ago
Extracting Logic Circuit Structure from Conjunctive Normal Form Descriptions
Boolean Satisfiability is seeing increasing use as a decision procedure in Electronic Design Automation (EDA) and other domains. Most applications encode their domain specific cons...
Zhaohui Fu, Sharad Malik
TCS
2010
13 years 3 months ago
Translating propositional extended conjunctions of Horn clauses into Boolean circuits
Horn⊃ is a logic programming language which extends usual Horn clauses by adding intuitionistic implication in goals and clause bodies. This extension can be seen as a form of s...
Joxe Gaintzarain, Montserrat Hermo, Paqui Lucio, M...
AAAI
2008
13 years 7 months ago
Prime Implicate Normal Form for ALC Concepts
In this paper, we present a normal form for concept expressions in the description logic ALC which is based on a recently introduced notion of prime implicate for the modal logic ...
Meghyn Bienvenu
IJCSS
2007
133views more  IJCSS 2007»
13 years 5 months ago
Synthesis of Read-Once Digital Hardware with Reduced Energy Delay Product
This paper presents a low power driven synthesis framework for the unique class of nonregenerative Boolean Read-Once Functions (BROF). A two-pronged approach is adopted, where the...
P. Balasubramanian, S. Theja
ICCS
1998
Springer
13 years 9 months ago
Matching in Description Logics: Preliminary Results
Matching of concepts with variables (concept patterns) is a relatively new operation that has been introduced in the context of concept description languages (description logics),...
Franz Baader, Alexander Borgida, Deborah L. McGuin...