Sciweavers

26 search results - page 4 / 6
» A Model Elimination Calculus for Generalized Clauses
Sort
View
CADE
1998
Springer
13 years 11 months ago
Strict Basic Superposition
It is a well-known fact that some form of factoring is necessary for completeness of paramodulation-based calculi of general first-order clauses. In this paper we give an overview...
Leo Bachmair, Harald Ganzinger
NGC
1998
Springer
115views Communications» more  NGC 1998»
13 years 7 months ago
On Semantic Resolution with Lemmaizing and Contraction and a Formal Treatment of Caching
Reducing redundancy in search has been a major concern for automated deduction. Subgoal-reduction strategies, such as those based on model elimination and implemented in Prolog te...
Maria Paola Bonacina, Jieh Hsiang
DAM
1999
100views more  DAM 1999»
13 years 7 months ago
Complexity Analysis of Propositional Resolution with Autarky Pruning
An algorithm called Modoc", which has been introduced elsewhere, enhances propositional model elimination with autarky pruning, and other features. The model elimination meth...
Allen Van Gelder
TSP
2010
13 years 2 months ago
Algorithms for Complex ML ICA and Their Stability Analysis Using Wirtinger Calculus
Abstract--We derive a class of algorithms for independent component analysis (ICA) based on maximum likelihood (ML) estimation and perform stability analysis of natural gradient ML...
Hualiang Li, Tülay Adali
CORR
2004
Springer
129views Education» more  CORR 2004»
13 years 7 months ago
On Generalized Records and Spatial Conjunction in Role Logic
We have previously introduced role logic as a notation for describing properties of relational structures in shape analysis, databases and knowledge bases. A natural fragment of ro...
Viktor Kuncak, Martin C. Rinard