 | 2011 |
|---|
| 47 |       | Maria Paola Bonacina,
Moa Johansson:
On Interpolation in Decision Procedures.
TABLEAUX 2011: 1-16 |
| 46 | | Maria Paola Bonacina,
Christopher Lynch,
Leonardo Mendonça de Moura:
On Deciding Satisfiability by Theorem Proving with Speculative Inferences.
J. Autom. Reasoning 47(2): 161-189 (2011) |
| 2010 |
|---|
| 45 | | Maria Paola Bonacina:
On theorem proving for program checking: historical perspective and recent developments.
PPDP 2010: 1-12 |
| 44 | | Maria Paola Bonacina,
Mnacho Echenim:
Theory decision by decomposition.
J. Symb. Comput. 45(2): 229-260 (2010) |
| 2009 |
|---|
| 43 | | Maria Paola Bonacina,
Christopher Lynch,
Leonardo Mendonça de Moura:
On Deciding Satisfiability by DPLL(G+T) and Unsound Theorem Proving.
CADE 2009: 35-50 |
| 42 | | Alessandro Armando,
Maria Paola Bonacina,
Silvio Ranise,
Stephan Schulz:
New results on rewrite-based satisfiability procedures.
ACM Trans. Comput. Log. 10(1): (2009) |
| 2008 |
|---|
| 41 | | Maria Paola Bonacina,
Nachum Dershowitz:
Canonical Inference for Implicational Systems.
IJCAR 2008: 380-395 |
| 40 | | Maria Paola Bonacina,
Mnacho Echenim:
On Variable-inactivity and Polynomial tau-Satisfiability Procedures.
J. Log. Comput. 18(1): 77-96 (2008) |
| 2007 |
|---|
| 39 | | Maria Paola Bonacina,
Mnacho Echenim:
T-Decision by Decomposition.
CADE 2007: 199-214 |
| 38 | | Maria Paola Bonacina,
Nachum Dershowitz:
Abstract canonical inference.
ACM Trans. Comput. Log. 8(1): (2007) |
| 37 | | Maria Paola Bonacina,
Mnacho Echenim:
Rewrite-Based Decision Procedures.
Electr. Notes Theor. Comput. Sci. 174(11): 27-45 (2007) |
| 36 | | Maria Paola Bonacina,
Mnacho Echenim:
Rewrite-Based Satisfiability Procedures for Recursive Data Structures.
Electr. Notes Theor. Comput. Sci. 174(8): 55-70 (2007) |
| 2006 |
|---|
| 35 | | Maria Paola Bonacina,
Silvio Ghilardi,
Enrica Nicolini,
Silvio Ranise,
Daniele Zucchelli:
Decidability and Undecidability Results for Nelson-Oppen and Rewrite-Based Decision Procedures.
IJCAR 2006: 513-527 |
| 34 | | Alessandro Armando,
Maria Paola Bonacina,
Silvio Ranise,
Stephan Schulz:
New results on rewrite-based satisfiability procedures
CoRR abs/cs/0604054: (2006) |
| 33 |  | Maria Paola Bonacina,
Alberto Martelli:
Automated Reasoning.
Intelligenza Artificiale 3(1-2): 14-20 (2006) |
| 2005 |
|---|
| 32 | | Alessandro Armando,
Maria Paola Bonacina,
Silvio Ranise,
Stephan Schulz:
On a Rewriting Approach to Satisfiability Procedures: Extension, Combination of Theories and an Experimental Appraisal.
FroCos 2005: 65-80 |
| 31 | | Maria Paola Bonacina,
Thierry Boy de la Tour:
Preface.
Electr. Notes Theor. Comput. Sci. 125(2): 1-3 (2005) |
| 30 | | Maria Paola Bonacina:
Towards a unified model of search in theorem-proving: subgoal-reduction strategies.
J. Symb. Comput. 39(2): 209-255 (2005) |
| 2004 |
|---|
| 29 | | Maria Paola Bonacina,
Nachum Dershowitz:
Abstract Canonical Inference
CoRR cs.LO/0406030: (2004) |
| 2001 |
|---|
| 28 | | Maria Paola Bonacina:
Combination of Distributed Search and Multi-search in Peers-mcd.d.
IJCAR 2001: 448-452 |
| 27 | | Maria Paola Bonacina,
Bernhard Gramlich:
Preface: STRATEGIES 2001.
Electr. Notes Theor. Comput. Sci. 58(2): 217-218 (2001) |
| 2000 |
|---|
| 26 | | Maria Paola Bonacina:
A taxonomy of parallel strategies for deduction.
Ann. Math. Artif. Intell. 29(1-4): 223-257 (2000) |
| 1999 |
|---|
| 25 | | Maria Paola Bonacina:
A Taxonomy of Theorem-Proving Strategies.
Artificial Intelligence Today 1999: 43-84 |
| 24 | | Maria Paola Bonacina:
A model and a first analysis of distributed-search contraction-based strategies.
Ann. Math. Artif. Intell. 27(1-4): 149-199 (1999) |
| 1998 |
|---|
| 23 | | Maria Paola Bonacina:
Analysis of Distributed-Search Contraction-Based Strategies.
JELIA 1998: 107-121 |
| 22 | | Maria Paola Bonacina,
Jieh Hsiang:
On the Modelling of Search in Theorem Proving - Towards a Theory of Strategy Analysis.
Inf. Comput. 147(2): 171-208 (1998) |
| 21 | | Maria Paola Bonacina,
Jieh Hsiang:
On Semantic Resolution with Lemmaizing and Contraction and a Formal Treatment of Caching.
New Generation Comput. 16(2): 163-200 (1998) |
| 1997 |
|---|
| 20 | | Maria Paola Bonacina:
The Clause-Diffusion Theorem Prover Peers-mcd (System Description).
CADE 1997: 53-56 |
| 19 | | Maria Paola Bonacina:
Experiments with subdivision of search in distributed theorem proving.
PASCO 1997: 88-100 |
| 1996 |
|---|
| 18 | | Maria Paola Bonacina,
Jieh Hsiang:
On Semantic Resolution with Lemmaizing and Contraction.
PRICAI 1996: 372-386 |
| 17 | | Maria Paola Bonacina,
Jieh Hsiang:
A Category-Theoretic Treatment of Automated Theorem Proving.
J. Inf. Sci. Eng. 12(1): 101-125 (1996) |
| 16 | | Maria Paola Bonacina:
On the Reconstruction of Proofs in Distributed Theorem Proving: a Modified Clause-Diffusion Method.
J. Symb. Comput. 21(4): 507-522 (1996) |
| 15 | | Hantao Zhang,
Maria Paola Bonacina,
Jieh Hsiang:
PSATO: a Distributed Propositional Prover and its Application to Quasigroup Problems.
J. Symb. Comput. 21(4): 543-560 (1996) |
| 1995 |
|---|
| 14 | | Maria Paola Bonacina,
Jieh Hsiang:
The Clause-Diffusion Methodology for Distributed Deduction.
Fundam. Inform. 24(1/2): 177-207 (1995) |
| 13 | | Maria Paola Bonacina,
Jieh Hsiang:
Distributed Deduction by Clause-Diffusion: Distributed Contraction and the Aquarius Prover.
J. Symb. Comput. 19(1-3): 245-267 (1995) |
| 12 | | Maria Paola Bonacina,
Jieh Hsiang:
Towards a Foundation of Completion Procedures as Semidecision Procedures.
Theor. Comput. Sci. 146(1&2): 199-242 (1995) |
| 1994 |
|---|
| 11 | | Maria Paola Bonacina,
William McCune:
Distributed Theorem Proving by Peers.
CADE 1994: 841-845 |
| 10 | | Maria Paola Bonacina,
Jieh Hsiang:
Parallelization of Deduction Strategies: An Analytical Study.
J. Autom. Reasoning 13(1): 1-33 (1994) |
| 1993 |
|---|
| 9 | | Maria Paola Bonacina,
Jieh Hsiang:
Distributed Deduction by Clause-Diffusion: The Aquarius Prover.
DISCO 1993: 272-287 |
| 8 | | Maria Paola Bonacina,
Jieh Hsiang:
On Fairness in Distributed Automated Deduction.
STACS 1993: 141-152 |
| 1992 |
|---|
| 7 | | Maria Paola Bonacina,
Jieh Hsiang:
On Rewrite Programs: Semantics and Relationship with Prolog.
J. Log. Program. 14(1&2): 155-180 (1992) |
| 1991 |
|---|
| 6 | | Maria Paola Bonacina,
Jieh Hsiang:
On Fairness of Completion-Based Theorem Proving Strategies.
RTA 1991: 348-360 |
| 1990 |
|---|
| 5 | | Siva Anantharaman,
Maria Paola Bonacina:
An Application of Automated Equational Reasoning to Many-valued Logic.
CTRS 1990: 156-161 |
| 4 | | Maria Paola Bonacina,
Jieh Hsiang:
Completion Procedures as Semidecision Procedures.
CTRS 1990: 206-232 |
| 3 | | Maria Paola Bonacina,
Jieh Hsiang:
A System for Distributed Simplification-Based Theorem Proving.
Dagstuhl Seminar on Parallelization in Inference Systems 1990: 370 |
| 2 | | Maria Paola Bonacina,
Jieh Hsiang:
Operational and Denotational Semantics of Rewrite Programs.
NACLP 1990: 449-464 |
| 1989 |
|---|
| 1 | | Maria Paola Bonacina,
Giancarlo Sanna:
KBlab: An Equational Theorem Prover for the Macintosh.
RTA 1989: 548-550 |
Data released under the ODC-BY 1.0 license — See also our legal information page