Sciweavers

1802 search results - page 94 / 361
» Model-based Theory Combination
Sort
View
ATVA
2010
Springer
128views Hardware» more  ATVA 2010»
13 years 10 months ago
What's Decidable about Sequences?
Abstract. We present a first-order theory of (finite) sequences with integer elements, Presburger arithmetic, and regularity constraints, which can model significant properties of ...
Carlo A. Furia
CSL
2010
Springer
13 years 10 months ago
Embedding Deduction Modulo into a Prover
Deduction modulo consists in presenting a theory through rewrite rules to support automatic and interactive proof search. It induces proof search methods based on narrowing, such a...
Guillaume Burel
CADE
2006
Springer
14 years 9 months ago
Decidability and Undecidability Results for Nelson-Oppen and Rewrite-Based Decision Procedures
Abstract. In the context of combinations of theories with disjoint signatures, we classify the component theories according to the decidability of constraint satisability problems ...
Maria Paola Bonacina, Silvio Ghilardi, Enrica Nico...
CORR
2006
Springer
157views Education» more  CORR 2006»
13 years 9 months ago
DSmT: A new paradigm shift for information fusion
: The management and combination of uncertain, imprecise, fuzzy and even paradoxical or high conflicting sources of information has always been and still remains of primal importan...
Jean Dezert, Florentin Smarandache
AI
2008
Springer
13 years 7 months ago
MEBN: A language for first-order Bayesian knowledge bases
Although classical first-order logic is the de facto standard logical foundation for artificial intelligence, the lack of a built-in, semantically grounded capability for reasonin...
Kathryn B. Laskey