Sciweavers

2432 search results - page 247 / 487
» Cryptographic logical relations
Sort
View
ENTCS
2007
97views more  ENTCS 2007»
15 years 6 months ago
A Head-to-Head Comparison of de Bruijn Indices and Names
Often debates about pros and cons of various techniques for formalising lambda-calculi rely on subjective arguments, such as de Bruijn indices are hard to read for humans or nomin...
Stefan Berghofer, Christian Urban
133
Voted
FUIN
2007
92views more  FUIN 2007»
15 years 6 months ago
Foundations of Modal Deductive Databases
We give formulations for modal deductive databases and present a modal query language called MDatalog. We define modal relational algebras and give the seminaive evaluation algor...
Linh Anh Nguyen
NDJFL
2002
74views more  NDJFL 2002»
15 years 6 months ago
The Semantics of Entailment Omega
This paper discusses the relation between the minimal positive relevant logic B+ and intersection and union type theories. There is a marvellous coincidence between these very diff...
Mariangiola Dezani-Ciancaglini, Robert K. Meyer, Y...
INLG
2010
Springer
15 years 4 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
CONCUR
2003
Springer
15 years 12 months ago
Comparative Branching-Time Semantics
d Abstract) Christel Baier1 , Holger Hermanns2,3 , Joost-Pieter Katoen2 , and Verena Wolf1 1 Institut f¨ur Informatik I, University of Bonn R¨omerstraße 164, D-53117 Bonn, Germa...
Christel Baier, Holger Hermanns, Joost-Pieter Kato...