Sciweavers

1224 search results - page 76 / 245
» Theory decision by decomposition
Sort
View
FROCOS
2007
Springer
14 years 3 months ago
From KSAT to Delayed Theory Combination: Exploiting DPLL Outside the SAT Domain
In the last two decades we have witnessed an impressive advance in the efficiency of propositional satisfiability techniques (SAT), which has brought large and previously-intractab...
Roberto Sebastiani
ICCBR
2007
Springer
14 years 3 months ago
Application of the Revision Theory to Adaptation in Case-Based Reasoning: The Conservative Adaptation
Case-based reasoning aims at solving a problem by the adaptation of the solution of an already solved problem that has been retrieved in a case base. This paper defines an approach...
Jean Lieber
ENTCS
2008
89views more  ENTCS 2008»
13 years 11 months ago
CC(X): Semantic Combination of Congruence Closure with Solvable Theories
We present a generic congruence closure algorithm for deciding ground formulas in the combination of the theory of equality with uninterpreted symbols and an arbitrary built-in so...
Sylvain Conchon, Evelyne Contejean, Johannes Kanig...
MISQ
2002
111views more  MISQ 2002»
13 years 10 months ago
A Design Theory for Systems That Support Emergent Knowledge Processes
This paper addresses the design problem of providing IT support for emerging knowledge processes (EKPs). EKPs are organizational activity patterns that exhibit three characteristi...
M. Lynne Markus, Ann Majchrzak, Les Gasser
JAIR
2011
103views more  JAIR 2011»
13 years 6 months ago
Automated Search for Impossibility Theorems in Social Choice Theory: Ranking Sets of Objects
We present a method for using standard techniques from satisfiability checking to automatically verify and discover theorems in an area of economic theory known as ranking sets o...
C. Geist, Ulrich Endriss