104 search results - page 13 / 21 » Computing interpolants in implicational logics |
POPL
2012
ACM
12 years 3 months ago
2012
ACM
Functional reactive programming (FRP) is an elegant and successful approach to programming reactive systems declaratively. The high levels of abstraction and expressivity that mak...
ICPPW
2008
IEEE
14 years 1 months ago
2008
IEEE
Event traces are helpful in understanding the performance behavior of message-passing applications since they allow in-depth analyses of communication and synchronization patterns...
LPAR
2005
Springer
14 years 27 days ago
2005
Springer
The notion of comparative similarity ‘X is more similar or closer to Y than to Z’ has been investigated in both foundational and applied areas of knowledge representation and r...
TCS
2010
13 years 5 months ago
2010
Horn⊃ is a logic programming language which extends usual Horn clauses by adding intuitionistic implication in goals and clause bodies. This extension can be seen as a form of s...
WOLLIC
2009
Springer
14 years 2 months ago
2009
Springer
We give a simple intuitionistic completeness proof of Kripke semantics with constant domain for intuitionistic logic with implication and universal quantification. We use a cut-fr...