Sciweavers

603 search results - page 52 / 121
» Embedded Formulas Extraction
Sort
View
SOFSEM
2010
Springer
14 years 5 months ago
Finding and Certifying Loops
Abstract. The first part of this paper presents a new approach for automatically proving nontermination of string rewrite systems. We encode rewrite sequences as propositional for...
Harald Zankl, Christian Sternagel, Dieter Hofbauer...
ACIVS
2009
Springer
14 years 3 months ago
Attributed Graph Matching Using Local Descriptions
Abstract. In the pattern recognition context, objects can be represented as graphs with attributed nodes and edges involving their relations. Consequently, matching attributed grap...
Salim Jouili, Ines Mili, Salvatore Tabbone
SAT
2010
Springer
160views Hardware» more  SAT 2010»
14 years 17 days ago
Reconstructing Solutions after Blocked Clause Elimination
Abstract. Preprocessing has proven important in enabling efficient Boolean satisfiability (SAT) solving. For many real application scenarios of SAT it is important to be able to ...
Matti Järvisalo, Armin Biere
IBPRIA
2007
Springer
14 years 17 days ago
New Measure for Shape Elongation
Shape elongation is one of the basic shape descriptors that has a very clear intuitive meaning. That is reason for its applicability in many shape classification tasks. In this pap...
Milos Stojmenovic, Jovisa D. Zunic
TABLEAUX
1995
Springer
14 years 7 days ago
On Transforming Intuitionistic Matrix Proofs into Standard-Sequent Proofs
We present a procedure transforming intuitionistic matrix proofs into proofs within the intuitionistic standard sequent calculus. The transformation is based on L. Wallen’s proof...
Stephan Schmitt, Christoph Kreitz