725 search results - page 95 / 145 » Complexity of Computing with Extended Propositional Logic Pr... |
116
Voted
ICALP
2004
Springer
15 years 8 months ago
2004
Springer
Monadic least fixed point logic MLFP is a natural logic whose expressiveness lies between that of first-order logic FO and monadic second-order logic MSO. In this paper we take ...
166
Voted
JCST
2010
14 years 9 months ago
2010
With recent efforts to build foundational certified software systems, two different approaches have been proposed to certify thread context switching. One is to certify both thread...
239
Voted
POPL
2005
ACM
16 years 2 months ago
2005
ACM
on Predicate Abstraction and Fair Termination Andreas Podelski Andrey Rybalchenko Max-Planck-Institut f?ur Informatik Saarbr?ucken, Germany Predicate abstraction is the basis of m...
103
click to vote
PPDP
2007
Springer
15 years 8 months ago
2007
Springer
We propose a framework to construct web-oriented user interfaces in a high-level way by exploiting declarative programming techniques. Such user interfaces are intended to manipul...
119
Voted
ICLP
2004
Springer
15 years 8 months ago
2004
Springer
Arc-Consistency (AC) techniques have been used extensively in the study of Constraint Satisfaction Problems (CSP). These techniques are used to simplify the CSP before or during th...