Sciweavers

193 search results - page 9 / 39
» Incremental logic rectification
Sort
View
SPIESR
1996
141views Database» more  SPIESR 1996»
13 years 9 months ago
Describing and Classifying Multimedia Using the Description Logic GRAIL
Many applications would benefit if media objects such as images could be selected and classified (or clustered) such that "conceptually similar" images are grouped toget...
Carole A. Goble, Christian Haul, Sean Bechhofer
CADE
2001
Springer
14 years 8 months ago
Incremental Closure of Free Variable Tableaux
Abstract. This paper presents a technique for automated theorem proving with free variable tableaux that does not require backtracking. Most existing automated proof procedures usi...
Martin Giese
ICLP
2009
Springer
14 years 8 months ago
Logic Programming with Defaults and Argumentation Theories
We define logic programs with defaults and argumentation theories, a new framework that unifies most of the earlier proposals for defeasible reasoning in logic programming. We pres...
Hui Wan, Benjamin N. Grosof, Michael Kifer, Paul F...
TCAD
2008
112views more  TCAD 2008»
13 years 7 months ago
Exploiting Symmetries to Speed Up SAT-Based Boolean Matching for Logic Synthesis of FPGAs
Boolean matching is one of the enabling techniques for technology mapping and logic resynthesis of Field Programmable Gate Array (FPGA). SAT-based Boolean matching (SAT-BM) has bee...
Yu Hu, Victor Shih, Rupak Majumdar, Lei He
DATE
2010
IEEE
104views Hardware» more  DATE 2010»
14 years 21 days ago
Large-scale Boolean matching
— We propose a methodology for Boolean matching under permutations of inputs and outputs (PP-equivalence checking problem) — a key step in incremental logic design that identif...
Hadi Katebi, Igor L. Markov