Sciweavers

4401 search results - page 314 / 881
» Computing with Default Logic
Sort
View
CORR
2008
Springer
98views Education» more  CORR 2008»
15 years 6 months ago
Logics for the Relational Syllogistic
The Aristotelian syllogistic cannot account for the validity of certain inferences involving relational facts. In this paper, we investigate the prospects for providing a relationa...
Ian Pratt-Hartmann, Lawrence S. Moss
TCAD
2008
112views more  TCAD 2008»
15 years 6 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
JAIR
2007
108views more  JAIR 2007»
15 years 6 months ago
Discovering Classes of Strongly Equivalent Logic Programs
We report on a successful experiment of computeraided theorem discovery in the area of logic programming with answer set semantics. Specifically, with the help of computers, we d...
Fangzhen Lin, Yin Chen
AI
2002
Springer
15 years 6 months ago
Conditional independence in propositional logic
Independence--the study of what is relevant to a given problem of reasoning--is an important AI topic. In this paper, we investigate several notions of conditional independence in...
Jérôme Lang, Paolo Liberatore, Pierre...
IS
2002
15 years 6 months ago
Pushing extrema aggregates to optimize logic queries
In this paper, we explore the possibility of transforming queries with minimum and maximum predicates into equivalent queries that can be computed more efficiently. The main contr...
Filippo Furfaro, Sergio Greco, Sumit Ganguly, Carl...