Sciweavers

338 search results - page 26 / 68
» Soundness and Completeness of a Logic Programming Approach t...
Sort
View
ICFP
2009
ACM
14 years 8 months ago
Complete and decidable type inference for GADTs
GADTs have proven to be an invaluable language extension, a.o. for ensuring data invariants and program correctness. Unfortunately, they pose a tough problem for type inference: w...
Tom Schrijvers, Simon L. Peyton Jones, Martin Sulz...
FROCOS
2000
Springer
13 years 11 months ago
Structured Sequent Calculi for Combining Intuitionistic and Classical First-Order Logic
We define a sound and complete logic, called FO , which extends classical first-order predicate logic with intuitionistic implication. As expected, to allow the interpretation of i...
Paqui Lucio
DBPL
1993
Springer
89views Database» more  DBPL 1993»
13 years 11 months ago
Database Programming in Transaction Logic
This paper presents database applications of the recently proposed Transaction Logic—an extension of classical predicate logic that accounts in a clean and declarative fashion f...
Anthony J. Bonner, Michael Kifer, Mariano P. Conse...
HEURISTICS
2006
102views more  HEURISTICS 2006»
13 years 7 months ago
A logic of soft constraints based on partially ordered preferences
Representing and reasoning with an agent's preferences is important in many applications of constraints formalisms. Such preferences are often only partially ordered. One clas...
Nic Wilson
LATIN
2004
Springer
14 years 1 months ago
A Proof System and a Decision Procedure for Equality Logic
Equality logic with or without uninterpreted functions is used for proving the equivalence or refinement between systems (hardware verification, compiler’s translation, etc). C...
Olga Tveretina, Hans Zantema