2035 search results - page 292 / 407 » On the complexity of stratified logics |
117
click to vote
DLOG
2010
14 years 10 months ago
2010
Abstract. Abductive reasoning has been recognized as a valuable complement to deductive inference for tasks such as diagnosis and integration of incomplete information despite its ...
122
Voted
CORR
2010
Springer
14 years 10 months ago
2010
Springer
Our work concerns the elucidation of the cancer (epi)genome, transcriptome and proteome to better understand the complex interplay between a cancer cell's molecular state and ...
107
Voted
TOCL
2011
14 years 7 months ago
2011
In a seminal paper from 1985, Sistla and Clarke showed that the model-checking problem for Linear Temporal Logic (LTL) is either NP-complete or PSPACE-complete, depending on the s...
105
Voted
DAC
2008
ACM
16 years 1 months ago
2008
ACM
Boolean function bi-decomposition is a fundamental operation in logic synthesis. A function f(X) is bi-decomposable under a variable partition XA, XB, XC on X if it can be written...
131
Voted
WWW
2003
ACM
16 years 1 months ago
2003
ACM
SweetDeal is a rule-based approach to representation of business contracts that enables software agents to create, evaluate, negotiate, and execute contracts with substantial auto...