1795 search results - page 218 / 359 » On the Complexity of Circuit Satisfiability |
KI
2006
Springer
13 years 10 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...
SYNTHESE
2008
13 years 10 months ago
2008
We add a limited but useful form of quantification to Coalition Logic, a popular formalism for reasoning about cooperation in game-like multi-agent systems. The basic constructs o...
TCS
2008
13 years 10 months ago
2008
We define a new cost model for the call-by-value lambda-calculus satisfying the invariance thesis. That is, under the proposed cost model, Turing machines and the call-by-value la...
TVCG
2008
13 years 10 months ago
2008
Abstract-- Network data frequently arises in a wide variety of fields, and node-link diagrams are a very natural and intuitive representation of such data. In order for a node-link...
CORR
2004
Springer
13 years 10 months ago
2004
Springer
Autonomic computing has been proposed recently as a way to address the difficult management of applications whose complexity is constantly increasing. Autonomous applications will ...