725 search results - page 79 / 145 » Complexity of Computing with Extended Propositional Logic Pr... |
155
click to vote
ICALP
2009
Springer
16 years 6 months ago
2009
Springer
Abstract. Tile sets and tilings of the plane appear in many topics ranging from logic (the Entscheidungsproblem) to physics (quasicrystals). The idea is to enforce some global prop...
176
click to vote
ICFP
2000
ACM
15 years 10 months ago
2000
ACM
We review the close relationship between abstract machines for (call-by-name or call-by-value) λ-calculi (extended with Felleisen’s C) and sequent calculus, reintroducing on the...
266
click to vote
PADL
2009
Springer
16 years 6 months ago
2009
Springer
Abstract. Boyer and Moore's ACL2 theorem prover combines firstorder applicative Common Lisp with a computational, first-order logic. While ACL2 has become popular and is being...
157
click to vote
LICS
2006
IEEE
16 years 5 days ago
2006
IEEE
— In a data word each position carries a label from a finite alphabet and a data value from some infinite domain. These models have been already considered in the realm of semi...
179
click to vote
AMAI
2004
Springer
15 years 6 months ago
2004
Springer
We introduce the notion of combinatorial vote, where a group of agents (or voters) is supposed to express preferences and come to a common decision concerning a set of non-independ...