Sciweavers

1727 search results - page 73 / 346
» A Technique for Large Automated Mechanism Design Problems
Sort
View
CADE
2005
Springer
16 years 6 months ago
Reflecting Proofs in First-Order Logic with Equality
Our general goal is to provide better automation in interactive proof assistants such as Coq. We present an interpreter of proof traces in first-order multi-sorted logic with equal...
Evelyne Contejean, Pierre Corbineau
FLAIRS
2003
15 years 7 months ago
Proving Harder Theorems by Axiom Reduction
Automated Theorem Proving (ATP) problems may contain unnecessary axioms, either because some of the axiomatization of the theory is irrelevant to the particular theorem, or becaus...
Geoff Sutcliffe, Alexander Dvorský
CADE
2007
Springer
16 years 14 days ago
Semantic Selection of Premisses for Automated Theorem Proving
We develop and implement a novel algorithm for discovering the optimal sets of premisses for proving and disproving conjectures in first-order logic. The algorithm uses interpret...
Petr Pudlak
DSN
2008
IEEE
16 years 23 days ago
Anomaly? application change? or workload change? towards automated detection of application performance anomaly and change
: Automated tools for understanding application behavior and its changes during the application life-cycle are essential for many performance analysis and debugging tasks. Applicat...
Ludmila Cherkasova, Kivanc M. Ozonat, Ningfang Mi,...
GPCE
2005
Springer
15 years 11 months ago
Applying a Generative Technique for Enhanced Genericity and Maintainability on the J2EE Platform
One of the themes in building reusable and maintainable software is identifying similarities and designing generic solutions to unify similarity patterns. In this paper, we analyze...
Yang Jun, Stan Jarzabek