Sciweavers

467 search results - page 8 / 94
» Designer Definites in Logical Form
Sort
View
TPHOL
1992
IEEE
13 years 11 months ago
The HOL Logic Extended with Quantification over Type Variables
The HOL system is an LCF-style mechanized proof-assistant for conducting proofs in higher order logic. This paper discusses a proposal to extend the primitive basis of the logic un...
Thomas F. Melham
AAAI
2008
13 years 10 months ago
On the Progression of Situation Calculus Basic Action Theories: Resolving a 10-year-old Conjecture
In a seminal paper, Lin and Reiter introduced a modeltheoretic definition for the progression of the initial knowledge base of a basic action theory. This definition comes with a ...
Stavros Vassos, Hector J. Levesque
IJDAR
2006
103views more  IJDAR 2006»
13 years 7 months ago
Table-processing paradigms: a research survey
Tables are a ubiquitous form of communication. While everyone seems to know what a table is, a precise, analytical definition of "tabularity" remains elusive because some...
David W. Embley, Matthew Hurst, Daniel P. Lopresti...
ICDT
2012
ACM
247views Database» more  ICDT 2012»
11 years 10 months ago
A normal form for preventing redundant tuples in relational databases
We introduce a new normal form, called essential tuple normal form (ETNF), for relations in a relational database where the constraints are given by functional dependencies and jo...
Hugh Darwen, C. J. Date, Ronald Fagin
CADE
2006
Springer
14 years 8 months ago
Partial Recursive Functions in Higher-Order Logic
Abstract. Based on inductive definitions, we develop an automated tool for defining partial recursive functions in Higher-Order Logic and providing appropriate reasoning tools for ...
Alexander Krauss