4513 search results - page 100 / 903 » Logic programming with satisfiability |
128
click to vote
WWW
2004
ACM
16 years 3 months ago
2004
ACM
This paper investigates how the vision of the Semantic Web can be carried over to the realm of email. We introduce a general notion of semantic email, in which an email message co...
125
click to vote
AAAI
1990
15 years 4 months ago
1990
An equational approach to the synthesis of functional and logic programs is taken. Typically, a target program contains equations that are only true in the standard model of the g...
108
click to vote
CORR
2010
Springer
15 years 3 months ago
2010
Springer
We introduce a generic extension of the popular branching-time logic CTL which refines the temporal until and release operators with formal languages. For instance, a language may ...
113
click to vote
CADE
2001
Springer
16 years 3 months ago
2001
Springer
Abstract. Nontrivial meta-complexity theorems, proved once for a programming language as a whole, facilitate the presentation and analysis of particular algorithms. This paper give...