Comparing Instance Generation Methods for Automated Reasoning

2005 ◽  
pp. 153-168 ◽  
Author(s):  
Swen Jacobs ◽  
Uwe Waldmann
Keyword(s):  
Automated Reasoning ◽  
Instance Generation

Comparing Instance Generation Methods for Automated Reasoning

2006 ◽  
Vol 38 (1-3) ◽  
pp. 57-78 ◽  
Author(s):  
Swen Jacobs ◽  
Uwe Waldmann
Keyword(s):  
Automated Reasoning ◽  
Instance Generation

Experiments Illustrating the Importance of Automated Reasoning in Spacecraft Reactor Control

1991 ◽  
Author(s):  
John A. Bernard ◽  
Francis J. Wyant
Keyword(s):  
Automated Reasoning ◽  
Reactor Control

Automated reasoning about enterprise concepts

1997 ◽  
Vol 18 (2) ◽  
pp. 56-58 ◽  
Author(s):  
Ernesto Compatangelo ◽  
Giovanni Rumolo
Keyword(s):  
Automated Reasoning

scholarly journals Model Completeness, Uniform Interpolants and Superposition Calculus

2021 ◽  
Author(s):  
Diego Calvanese ◽  
Silvio Ghilardi ◽  
Alessandro Gianola ◽  
Marco Montali ◽  
Andrey Rivkin
Keyword(s):  
Automated Reasoning ◽  
Quantifier Elimination ◽  
Effective Solution ◽  
Model Completeness ◽  
Present Contribution ◽  
First Order ◽  
Reduction Strategies ◽  
Infinite State Systems ◽  
Infinite State ◽  
Superposition Calculus

AbstractUniform interpolants have been largely studied in non-classical propositional logics since the nineties; a successive research line within the automated reasoning community investigated uniform quantifier-free interpolants (sometimes referred to as “covers”) in first-order theories. This further research line is motivated by the fact that uniform interpolants offer an effective solution to tackle quantifier elimination and symbol elimination problems, which are central in model checking infinite state systems. This was first pointed out in ESOP 2008 by Gulwani and Musuvathi, and then by the authors of the present contribution in the context of recent applications to the verification of data-aware processes. In this paper, we show how covers are strictly related to model completions, a well-known topic in model theory. We also investigate the computation of covers within the Superposition Calculus, by adopting a constrained version of the calculus and by defining appropriate settings and reduction strategies. In addition, we show that computing covers is computationally tractable for the fragment of the language used when tackling the verification of data-aware processes. This observation is confirmed by analyzing the preliminary results obtained using the mcmt tool to verify relevant examples of data-aware processes. These examples can be found in the last version of the tool distribution.

Adversarial Imbalance Classification with Class-Specific Diverse Instance Generation

2021 ◽  
Author(s):  
Qihang Shen ◽  
Xinyue Wang ◽  
Zixin Cai ◽  
Liping Jing
Keyword(s):  
Instance Generation
Sign in / Sign up

Export Citation Format

Share Document