5482 search results - page 551 / 1097 » Logic Programming and Databases |
211
click to vote
CSL
2007
Springer
16 years 1 months ago
2007
Springer
Abstract. Probably the most significant result concerning cut-free sequent calculus proofs in linear logic is the completeness of focused proofs. This completeness theorem has a n...
172
click to vote
ICALP
2004
Springer
16 years 13 days ago
2004
Springer
Monadic least fixed point logic MLFP is a natural logic whose expressiveness lies between that of first-order logic FO and monadic second-order logic MSO. In this paper we take ...
197
click to vote
SAS
2004
Springer
16 years 12 days ago
2004
Springer
Abstract. In this paper we investigate the existence of a deductive veri cation method based on a logic that describes pointer aliasing. The main idea of such a method is that the ...
280
click to vote
SIGMOD
2005
ACM
16 years 7 months ago
2005
ACM
We give semantic characterizations of the expressive power of navigational XPath (also called Core XPath) in terms of first order logic. XPath can be used to specify sets of nodes...
234
click to vote
EDBT
2002
ACM
16 years 7 months ago
2002
ACM
Ontologies are set to play a key role in the "Semantic Web", extending syntactic interoperability to semantic interoperability by providing a source of shared and precise...