4192 search results - page 591 / 839 » Probabilistic Logic Programming |
138
Voted
FOSSACS
2007
Springer
15 years 10 months ago
2007
Springer
We study the complexity of satisfiability for the expressive extension ICPDL of PDL (Propositional Dynamic Logic), which admits intersection and converse as program operations. Ou...
118
click to vote
SGAI
2007
Springer
15 years 9 months ago
2007
Springer
In this paper we describe a novel technique which implements a spatiotemporal model as a set of sub-models based on first order logic. These sub-models model different, typicall...
138
click to vote
APLAS
2006
ACM
15 years 9 months ago
2006
ACM
We present a local relational reasoning method for reasoning about contextual equivalence of expressions in a λ-calculus with recursive types and general references. Our developme...
119
click to vote
SAC
2006
ACM
15 years 9 months ago
2006
ACM
We provide sufficient conditions that formally guarantee that the floating-point computation of a polynomial evaluation is faithful. To this end, we develop a formalization of ...
113
Voted
RULEML
2005
Springer
15 years 9 months ago
2005
Springer
In this paper we argue that a realistic architecture for the Semantic Web must be based on multiple independent, but interoperable, stacks of languages. In particular, we argue tha...