2035 search results - page 126 / 407 » On the complexity of stratified logics |
159
click to vote
KI
2006
Springer
15 years 6 months ago
2006
Springer
Motivated by a chemical process engineering application, we introduce a new concept constructor in Description Logics (DLs), an n-ary variant of the existential restriction constr...
151
click to vote
TCAD
2008
15 years 6 months ago
2008
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...
169
click to vote
AI
2002
Springer
15 years 6 months ago
2002
Springer
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...
156
click to vote
LOGCOM
2010
15 years 4 months ago
2010
The logic of proofs (LP) was proposed as Gödel’s missed link between Intuitionistic and S4-proofs, but so far the tableau-based methods proposed for LPhave not explored this cl...
129
click to vote
CF
2006
ACM
16 years 10 days ago
2006
ACM
Bytecode hardware-translation improves the performance of a Java Virtual Machine (JVM) with small hardware resource and complexity overhead. Instruction folding is a technique to ...