3047 search results - page 116 / 610 » On the Meaning of Logical Completeness |
294
click to vote
POPL
2008
ACM
16 years 6 months ago
2008
ACM
We propose a characterization of PSPACE by means of a type assignment for an extension of lambda calculus with a conditional construction. The type assignment STAB is an extension...
159
click to vote
ICDT
2007
ACM
16 years 14 days ago
2007
ACM
The first aim of this paper is to present the logical core of XPath 2.0: a logically clean, decidable fragment, which includes most navigational features of XPath 2.0 (complex co...
150
click to vote
SP
2006
IEEE
16 years 10 days ago
2006
IEEE
We propose PS-LTL, a pure-past security linear temporal logic that allows the specification of a variety of authentication, secrecy and data freshness properties. Furthermore, we...
140
click to vote
ICGI
1994
Springer
15 years 10 months ago
1994
Springer
: This paper deals on defining object-oriented inferences by desining a new unification procedure called ?-unification (which leads to a sound and complete resolution) in DF-logic,...
157
click to vote
FUIN
2006
15 years 6 months ago
2006
We prove that negative hyper-resolution using any liftable and well-founded ordering refinement is a sound and complete procedure for answering queries in disjunctive logic program...