4513 search results - page 298 / 903 » Logic programming with satisfiability |
108
click to vote
BIRTHDAY
2005
Springer
15 years 10 months ago
2005
Springer
We present an extension of first-order predicate logic with a novel predicate ‘at t’ meaning intuitively “this term is a variable symbol”. We give simple sequent proof-ru...
164
click to vote
CONCUR
2005
Springer
15 years 10 months ago
2005
Springer
The context of this study is timed temporal logics for timed automata. In this paper, we propose an extension of the classical logic TCTL with a new Until modality, called “Until...
130
click to vote
TACAS
2007
Springer
15 years 10 months ago
2007
Springer
This paper presents a mechanised Hoare-style programming logic framework for assembly level programs. The framework has been designed to fit on top of operational semantics of rea...
154
click to vote
POPL
2010
ACM
15 years 6 months ago
2010
ACM
Computer science has served to insulate programs and programmers from knowledge of the underlying mechanisms used to manipulate information, however this fiction is increasingly h...
138
click to vote
APLAS
2004
ACM
2004
ACM
Translation of Tree-Processing Programs into Stream-Processing Programs Based on Ordered Linear Type
15 years 9 months ago
There are two ways to write a program for manipulating tree-structured data such as XML documents: One is to write a tree-processing program focusing on the logical structure of t...