Sciweavers

630 search results - page 86 / 126
» Combining Two Formalism for Reasoning about Concepts
Sort
View
LISP
2006
77views more  LISP 2006»
13 years 8 months ago
Expressing combinatory reduction systems derivations in the rewriting calculus
The last few years have seen the development of the rewriting calculus (also called rho-calculus or -calculus) that uniformly integrates first-order term rewriting and the -calculu...
Clara Bertolissi, Horatiu Cirstea, Claude Kirchner
CADE
1998
Springer
14 years 1 months ago
Strict Basic Superposition
It is a well-known fact that some form of factoring is necessary for completeness of paramodulation-based calculi of general first-order clauses. In this paper we give an overview...
Leo Bachmair, Harald Ganzinger
CORR
2010
Springer
157views Education» more  CORR 2010»
13 years 9 months ago
Deriving Specifications of Dependable Systems: toward a Method
Abstract--This paper proposes a method for deriving formal specifications of systems. To accomplish this task we pass through a non trivial number of steps, concepts and tools wher...
Manuel Mazzara
ICDT
1995
ACM
105views Database» more  ICDT 1995»
14 years 12 days ago
Datalog Queries of Set Constraint Databases
Abstract. Extension of the relational database model to represent complex data has been a focus of much research in recent years. At the same time, an alternative extension of the ...
Peter Z. Revesz
GLOBECOM
2008
IEEE
13 years 10 months ago
Automatic Large Scale Generation of Internet PoP Level Maps
—Point of presence (PoP) level Internet maps are promising for tasks such as reasoning about the Internet evolution in time or Internet delay estimation. We thus suggest an effi...
Dima Feldman, Yuval Shavitt