1677 search results - page 139 / 336 » On the Completeness of Quantum Computation Models |
169
click to vote
AAAI
2008
15 years 8 months ago
2008
We formulate loop formulas for logic programs with arbitrary constraint atoms, for the semantics based on conditional satisfaction. This provides a method for answer set computati...
167
click to vote
CONCUR
2010
Springer
15 years 7 months ago
2010
Springer
Abstract. Theories defined in a process model are formalized and studied. A theory in a process calculus is a set of perpetually available processes with finite interactability, ea...
193
click to vote
STACS
2007
Springer
16 years 19 days ago
2007
Springer
Hybrid logics extend modal logics by first-order concepts, in particular they allow a limited use of variables. Unfortunately, in general, satisfiability for hybrid formulas is u...
165
click to vote
BIRTHDAY
2005
Springer
16 years 2 days ago
2005
Springer
This paper is a guided tour through the theory of fibring as a general mechanism for combining logics. We present the main ideas, constructions and difficulties of fibring, from ...
234
click to vote
APLAS
2001
ACM
15 years 10 months ago
2001
ACM
Abstract. We propose a semantic and syntactic framework for modelling linearly used effects, by giving the monadic transforms of the computational lambda calculus (considered as th...