Sciweavers

1743 search results - page 20 / 349
» Generalized Modal Satisfiability
Sort
View
JCSS
2000
116views more  JCSS 2000»
13 years 9 months ago
Time-Space Tradeoffs for Satisfiability
We give the first nontrivial model-independent time-space tradeoffs for satisfiability. Namely, we show that SAT cannot be solved simultaneously in n1+o(1) time and n1space for an...
Lance Fortnow
CLUSTER
2007
IEEE
14 years 4 months ago
Satisfying your dependencies with SuperMatrix
— SuperMatrix out-of-order scheduling leverages el abstractions and straightforward data dependency analysis to provide a general-purpose mechanism for obtaining parallelism from...
Ernie Chan, Field G. Van Zee, Enrique S. Quintana-...
SAC
2009
ACM
14 years 2 months ago
SWOBE - embedding the semantic web languages RDF, SPARQL and SPARUL into java for guaranteeing type safety, for checking the sat
The Semantic Web and its technologies become increasingly important. As more and more Semantic Web applications are being used, developing more stable Semantic Web applications be...
Sven Groppe, Jana Neumann, Volker Linnemann
AUSAI
2007
Springer
14 years 1 months ago
Branching Rules for Satisfiability Analysed with Factor Analysis
Factor analysis is a statistical technique for reducing the number of factors responsible for a matrix of correlations to a smaller number of factors that may reflect underlying va...
Richard J. Wallace, Stuart Bain
AAAI
2007
14 years 5 days ago
A Modal Logic for Beliefs and Pro Attitudes
Agents’ pro attitudes such as goals, intentions, desires, wishes, and judgements of satisfactoriness play an important role in how agents act rationally. To provide a natural an...
Kaile Su, Abdul Sattar, Han Lin, Mark Reynolds