Sciweavers

2410 search results - page 24 / 482
» Multiset Ordering Constraints
Sort
View
IJCNN
2006
IEEE
15 years 10 months ago
Sparse Optimization for Second Order Kernel Methods
— We present a new optimization procedure which is particularly suited for the solution of second-order kernel methods like e.g. Kernel-PCA. Common to these methods is that there...
Roland Vollgraf, Klaus Obermayer
CADE
2005
Springer
16 years 4 months ago
The Decidability of the First-Order Theory of Knuth-Bendix Order
Two kinds of orderings are widely used in term rewriting and theorem proving, namely recursive path ordering (RPO) and Knuth-Bendix ordering (KBO). They provide powerful tools to p...
Ting Zhang, Henny B. Sipma, Zohar Manna
CIE
2009
Springer
15 years 11 months ago
Complexity of Existential Positive First-Order Logic
Let Γ be a (not necessarily finite) structure with a finite relational signature. We prove that deciding whether a given existential positive sentence holds in Γ is in LOGSPACE...
Manuel Bodirsky, Miki Hermann, Florian Richoux
CAV
2009
Springer
184views Hardware» more  CAV 2009»
16 years 4 months ago
Monotonic Partial Order Reduction: An Optimal Symbolic Partial Order Reduction Technique
Abstract. We present a new technique called Monotonic Partial Order Reduction (MPOR) that effectively combines dynamic partial order reduction with symbolic state space exploration...
Vineet Kahlon, Chao Wang, Aarti Gupta
TPHOL
2007
IEEE
15 years 10 months ago
HOL2P - A System of Classical Higher Order Logic with Second Order Polymorphism
Abstract. This paper introduces the logical system HOL2P that extends classical higher order logic (HOL) with type operator variables and universal types. HOL2P has explicit term o...
Norbert Völker