Sciweavers

3440 search results - page 181 / 688
» Logics For Context-Free Languages
Sort
View
POPL
2007
ACM
16 years 7 months ago
Modular verification of a non-blocking stack
This paper contributes to the development of techniques for the modular proof of programs that include concurrent algorithms. We present a proof of a non-blocking concurrent algor...
Matthew J. Parkinson, Richard Bornat, Peter W. O'H...
ADC
2008
Springer
146views Database» more  ADC 2008»
16 years 1 months ago
A Typed Higher-Order Calculus for Querying XML Databases
As the eXtensible Markup Language (XML) is about to emerge as a new standard for databases, the problem of providing solid logical grounds for XML query languages arises. For the ...
Qing Wang, Klaus-Dieter Schewe
ICLP
1994
Springer
15 years 11 months ago
Compiling Intensional Sets in CLP
Constructive negation has been proved to be a valid alternative to negation as failure, especially when negation is required to have, in a sense, an `active' role. In this pa...
Paola Bruscoli, Agostino Dovier, Enrico Pontelli, ...
ICEIS
2010
IEEE
15 years 5 months ago
Graph-based Knowledge Representation and Reasoning
This paper presents a graph-based knowledge representation and reasoning language. This language benefits from an important syntactic operation, which is called a graph homomorphi...
M. Chein
INLG
2010
Springer
15 years 5 months ago
Grouping Axioms for More Coherent Ontology Descriptions
Ontologies and datasets for the Semantic Web are encoded in OWL formalisms that are not easily comprehended by people. To make ontologies accessible to human domain experts, sever...
Sandra Williams, Richard Power