530 search results - page 34 / 106 » The Valid Model Semantics for Logic Programs |
203
click to vote
POPL
2007
ACM
16 years 26 days ago
2007
ACM
We present a model of recursive and impredicatively quantified types with mutable references. We interpret in this model all of the type constructors needed for typed intermediate...
114
Voted
ICLP
2010
Springer
15 years 4 months ago
2010
Springer
[6]. An SBML model can be interpreted in Biocham at three abstraction levels: • the Boolean semantics (asynchronuous Boolean state transitions on the presence/absence of molecule...
132
click to vote
AGP
2003
IEEE
15 years 5 months ago
2003
IEEE
Many NP-complete problems can be encoded in the answer set semantics of logic programs in a very concise way, where the encoding reflects the typical “guess and check” nature ...
189
Voted
CP
2009
Springer
16 years 1 months ago
2009
Springer
Abstract. In this paper, we show how model-checking can be generalized to temporal logic constraint solving, by considering temporal logic formulae with free variables over some do...
78
Voted
APAL
2010
15 years 20 days ago
2010
A well-known polymodal provability logic GLP is complete w.r.t. the arithmetical semantics where modalities correspond to reflection principles of restricted logical complexity in...