Silvio Ghilardi  Home/Search
Context Related
| homes.dsi.unimi.it/~gh...jarprelim.pdf Cached: PS.gz PS PDF This document uses CoBlitz to cache paper downloads. If your firewall is blocking outgoing connections to port 3125, you can use these links to download local copies.
Image Update HelpPS.gz PS PDF From: homes.dsi.unimi.it/~ghilardi/ (more) (Enter author homepages) |
Rate this article:      (best)Comment on this article |
Abstract: We extend Nelson-Oppen combination procedure to the case of theories which are compatible with respect to a common subtheory in the shared signature. The notion of compatibility relies on model completions and related concepts from classical model theory. (Update)
Cited by: More
A New Combination Procedure for the Word Problem that.. - Baader, Ghilardi.. (2004) (Correct)
Combining Decision Procedures for Theories in Sorted Logics - Tinelli, Zarba (2004) (Correct)
Active bibliography (related documents): More All
2.6: Reasoners' Cooperation and Quantifier Elimination - Ghilardi (2003) (Correct)
1.0: Algebraic and Model Theoretic Techniques for Fusion.. - Ghilardi, Santocanale (2003) (Correct)
0.4: Little Engines of Proof - Shankar (2002) (Correct)
Similar documents based on text: More All
0.2: Upper bounds on the training error of ECOC SVM ensembles - Valentini (2000) (Correct)
0.2: Mutual Information Methods for Evaluating Dependence Among.. - Masulli, Valentini (2001) (Correct)
0.1: Path Rewriting and Combined Word Problems - Fiorentini, Ghilardi (2000) (Correct)
Related documents from co-citation: More All
2: Simplification by cooperating decision procedures (context) - Nelson, Oppen - 1979
2: Unions of non-disjoint theories and combinations of satisability procedures - Tinelli, Ringeissen - 2001
BibTeX entry: (Update)
Silvio Ghilardi. Model theoretic methods in combined constraint satisfiability. Journal of Automated Reasoning, 2004. (To appear). http://citeseer.ist.psu.edu/ghilardi04modeltheoretic.html More
@misc{ ghilardi04model,
author = "S. Ghilardi",
title = "Model theoretic methods in combined constraint satisfiability",
text = "Silvio Ghilardi. Model theoretic methods in combined constraint satisfiability.
Journal of Automated Reasoning, 2004. (To appear).",
year = "2004",
url = "citeseer.ist.psu.edu/ghilardi04modeltheoretic.html" }
Citations (may not include all citations):353 Term Rewriting and All That (context) - Baader, Nipkow - 1998
154 Simplification by Cooperating Decision Procedures (context) - Nelson, Oppen - 1979
142 Rewrite-based equational theorem proving with selection and .. (context) - Bachmair, Ganzinger - 1994
59 On Restrictions of Ordered Paramodulation with Simplificatio.. (context) - Bachmair, Ganzinger - 1990
49 A New Correctness Proof of the Nelson-Oppen Combination Proc.. - Tinelli, Harandi - 1996
43 Theorem Proving in Arithmetic without Multiplication (context) - Cooper - 1972
43 The Computational Complexity of Logical Theories (context) - Ferrante, Racko - 1979
35 pn -Upper Bound on the Complexity of Presburger Arithmetic (context) - Oppen - 1978
35 The Complexity of Linear Problems in Fields (context) - Weispfenning - 1988
34 Theoretical Computer Science (context) - Oppen - 1980
24 Equational Reasoning in Saturation-Based Theorem Proving - Bachmair, Ganzinger - 1998
23 Unions of Non-Disjoint Theories and Combination of Satisfiab.. - Tinelli, Ringeissen - 2003
22 Fusions of Modal Logics Revisited - Wolter - 1998
20 A new approach for combining decision procedures for the wor.. - Baader, Tinelli - 1997
16 Deciding the Word Problem in the Union of Equational Theorie.. - Baader, Tinelli - 2002
15 System Description: Spass Version (context) - Weidenbach, Afshordel et al. - 1999
14 Reasoning about Recursively Defined Data Structures (context) - Oppen - 1980
12 Cooperation of Background Reasoners in Theory Reasoning by R.. - Tinelli - 2003
6 Combining Word Problems through Rewriting in Categories with.. (context) - Fiorentini, Ghilardi - 2003
5 Combining Decision Procedures for Positive Theories Sharing .. - Baader, Tinelli - 2002
5 Model Completeness (context) - MacIntyre - 1977
3 Model-Companions and Definability in Existentially Complete .. (context) - Wheeler - 1976
3 Paramodulation-Based Theorem Proving (context) - Nieuwhenhuis, Rubio - 2001
3 Dipartimento di Scienze dell'Informazione (context) - Ghilardi, Reasoners'Cooperation - 2003
3 A General Setting for Flexibly Combining and Augmenting Deci.. (context) - Janicic, Bundy - 2002
3 Solving Numerical Constraints (context) - Bockmayr, Weispfenning - 2001
2 Trends in Logic Series (context) - Ghilardi, Zawadowski - 2002
1 Uniform Derivation of Superposition Based Decision Procedure.. (context) - Armando, Ranise et al. - 2001
1 al Logic, Vardi M., Voronkov A. "Logic for Programming, Arti.. (context) - Ghilardi, Santocanale - 2003
1 Axiomatizable Classes of Locally Free Algebras of Certain Ty.. (context) - Mal'cev - 1962
1 Proc. of the Int. Workshop on First Order Theorem Proving (F.. (context) - Tinelli, Zarba - 2003
1 IIIrd edition (context) - Chang, Keisler - 1990
Documents on the same site (http://homes.dsi.unimi.it/~ghilardi/):
Path Rewriting and Combined Word Problems - Fiorentini, Ghilardi (2000) (Correct)
Reasoners' Cooperation and Quantifier Elimination - Ghilardi (2003) (Correct)
Online articles have much greater impact More about CiteSeer.IST Add search form to your site Submit documents Feedback
CiteSeer.IST - Copyright Penn State and NEC