1391 search results - page 271 / 279 » Completeness of Neighbourhood Logic |
CSEE
2000
Springer
14 years 2 days ago
2000
Springer
Accurate and complete requirements specifications are crucial for the design and implementation of high-quality software. Unfortunately, the articulation and verification of softw...
IPPS
1999
IEEE
14 years 14 hour ago
1999
IEEE
Multi-FPGA systems (MFSs) are used as custom computing machines, logic emulators and rapid prototyping vehicles. A key aspect of these systems is their programmable routing archit...
FOCS
1998
IEEE
13 years 12 months ago
1998
IEEE
This paper deals with the evaluation of acyclic Boolean conjunctive queries in relational databases. By well-known results of Yannakakis [1981], this problem is solvable in polynom...
FTRTFT
1998
Springer
13 years 12 months ago
1998
Springer
A controversial issue in the formal methods community is the degree to which mathematical sophistication and theorem proving skills should be needed to apply a formal method. A fun...
MCMASTER
1993
13 years 11 months ago
1993
Abstract. This survey of the theory and applications of rewriting with equations discusses the existence and uniqueness of normal forms, the Knuth-Bendix completion procedure and i...