Sciweavers

317 search results - page 36 / 64
» Deductive Program Repair
Sort
View
69
Voted
CADE
2003
Springer
15 years 10 months ago
Source-Tracking Unification
We propose a practical path-based framework for deriving and simplifying source-tracking information for term unification in the empty theory. Such a framework is useful for debugg...
Venkatesh Choppella, Christopher T. Haynes
ISMVL
2000
IEEE
134views Hardware» more  ISMVL 2000»
15 years 2 months ago
The 2-SAT Problem of Regular Signed CNF Formulas
Signed conjunctive normal form (signed CNF) is a classical conjunctive clause form using a generalized notion of literal, called signed atom. A signed atom is an expression of the...
Bernhard Beckert, Reiner Hähnle, Felip Many&a...
SIGECOM
2005
ACM
122views ECommerce» more  SIGECOM 2005»
15 years 3 months ago
Robust solutions for combinatorial auctions
Bids submitted in auctions are usually treated as enforceable commitments in most bidding and auction theory literature. In reality bidders often withdraw winning bids before the ...
Alan Holland, Barry O'Sullivan
77
Voted
BIRTHDAY
2003
Springer
15 years 2 months ago
From CTL to Datalog
We provide a translation from CTL to Datalog¬ Succ. The translation has the following advantages: a) It is natural. b) It provides intuition to the expressive power of CTL and it...
Foto N. Afrati, Theodore Andronikos, Vassia Pavlak...
ISMIS
1993
Springer
15 years 1 months ago
Compiling Proof Search in Semantic Tableaux
An approach to implementing deduction systems based on semantic tableaux is described; it works by compiling a graphical representation of a fully expanded tableaux into a program...
Joachim Posegga