Sciweavers

571 search results - page 12 / 115
» Domain Theory in Logical Form
Sort
View
CADE
2006
Springer
15 years 10 months ago
Combining Type Theory and Untyped Set Theory
Abstract. We describe a second-order type theory with proof irrelevance. Within this framework, we give a representation of a form of Mac Lane set theory and discuss automated supp...
Chad E. Brown
APAL
2007
78views more  APAL 2007»
14 years 9 months ago
Partial Horn logic and cartesian categories
A logic is developed in which function symbols are allowed to represent partial functions. It has the usual rules of logic (in the form of a sequent calculus) except that the subs...
Erik Palmgren, Steven J. Vickers
175
Voted
ICLP
2009
Springer
15 years 10 months ago
Logic Programming with Defaults and Argumentation Theories
We define logic programs with defaults and argumentation theories, a new framework that unifies most of the earlier proposals for defeasible reasoning in logic programming. We pres...
Hui Wan, Benjamin N. Grosof, Michael Kifer, Paul F...
SIGMOD
1999
ACM
94views Database» more  SIGMOD 1999»
15 years 1 months ago
Logical Logging to Extend Recovery to New Domains
Recovery can be extended to new domains at reduced logging cost by exploiting "logical" log operations. During recovery, a logical log operation may read data values fro...
David B. Lomet, Mark R. Tuttle
ICDT
2012
ACM
247views Database» more  ICDT 2012»
13 years 1 days 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