Sciweavers

1199 search results - page 66 / 240
» Parameterized Proof Complexity
Sort
View
CADE
2005
Springer
14 years 9 months ago
Proof Planning for First-Order Temporal Logic
Proof planning is an automated reasoning technique which improves proof search by raising it to a meta-level. In this paper we apply proof planning to First-Order Linear Temporal L...
Claudio Castellini, Alan Smaill
TAMC
2010
Springer
14 years 1 months ago
Algebraic Proofs over Noncommutative Formulas
We study possible formulations of algebraic propositional proof systems operating with noncommutative formulas. We observe that a simple formulation gives rise to systems at least ...
Iddo Tzameret
ENTCS
2006
113views more  ENTCS 2006»
13 years 8 months ago
Mining Propositional Simplification Proofs for Small Validating Clauses
The problem of obtaining small conflict clauses in SMT systems has received a great deal of attention recently. We report work in progress to find small subsets of the current par...
Ian Wehrman, Aaron Stump
MICS
2008
129views more  MICS 2008»
13 years 8 months ago
ATP-based Cross-Verification of Mizar Proofs: Method, Systems, and First Experiments
Mizar is a proof assistant used for formalization and mechanical verification of mathematics. The main use of Mizar is in the development of the Mizar Mathematical Library (MML), i...
Josef Urban, Geoff Sutcliffe
GMP
2006
IEEE
14 years 2 months ago
Surface Creation and Curve Deformations Between Two Complex Closed Spatial Spline Curves
Abstract. This paper presents an algorithm to generate a smooth surface between two closed spatial spline curves. With the assumption that the two input curves can be projected to ...
Joel Daniels II, Elaine Cohen