Sciweavers

150 search results - page 11 / 30
» Understanding Promise Theory Using Rewriting Logic
Sort
View
CCS
2005
ACM
15 years 3 months ago
A rewriting-based inference system for the NRL protocol analyzer: grammar generation
The NRL Protocol Analyzer (NPA) is a tool for the formal specification and analysis of cryptographic protocols that has been used with great effect on a number of complex real-l...
Santiago Escobar, Catherine Meadows, José M...
DAC
2004
ACM
15 years 10 months ago
A new heuristic algorithm for reversible logic synthesis
Reversible logic has applications in many fields, including quantum computing. Synthesis techniques for reversible circuits are not well developed, even for functions with a small...
Pawel Kerntopf
ICDT
1990
ACM
110views Database» more  ICDT 1990»
15 years 1 months ago
Beginnings of a Theory of General Database Completions
Ordinary logical implication is not enough for answering queries in a logic database, since especially negative information is only implicitly represented in the database state. M...
Stefan Brass
FSTTCS
1993
Springer
15 years 1 months ago
Higher-Order and Semantic Unification
Abstract. We provide a complete system of transformation rules for semantic unification with respect to theories defined by convergent rewrite systems. We show that this standard u...
Nachum Dershowitz, Subrata Mitra
CAISE
2005
Springer
15 years 3 months ago
Query Processing Using Ontologies
Abstract. Recently, the database and AI research communities have paid increased attention to ontologies. The main motivating reason is that ontologies promise solutions for comple...
Chokri Ben Necib, Johann Christoph Freytag