95 search results - page 15 / 19 » On Notions of Completeness Weaker than Kripke Completeness |
TPHOL
2005
IEEE
14 years 2 months ago
2005
IEEE
Abstract. We present a set of problems that may support the development of calculi and theorem provers for classical higher-order logic. We propose to employ these test problems as...
PODS
2012
ACM
11 years 11 months ago
2012
ACM
Database theory and database practice are typically the domain of computer scientists who adopt what may be termed an algorithmic perspective on their data. This perspective is ve...
ACL
1996
13 years 10 months ago
1996
Charts constitute a natural uniform architecture for parsing and generation provided string position is replaced by a notion more appropriate to logical forms and that measures ar...
PODS
2008
ACM
14 years 9 months ago
2008
ACM
We revisit the classical chase procedure, studying its properties as well as its applicability to standard database problems. We settle (in the negative) the open problem of decid...
ASM
2010
ASM
14 years 3 months ago
2010
ASM
and formal model, named Kmelia [1,2], with an associated language to specify components, their provided and required services and their assemblies; we also developed a framework na...