Results 1  10
of
61
Complexity and algorithms for monomial and clausal predicate abstraction
 IN CADE
, 2009
"... In this paper, we investigate the asymptotic complexity of various predicate abstraction problems relative to the asymptotic complexity of checking an annotated program in a given assertion logic. Unlike previous approaches, we pose the predicate abstraction problem as a decision problem, instead of ..."
Abstract

Cited by 5 (3 self)
 Add to MetaCart
of the traditional inference problem. For assertion logics closed under weakest (liberal) precondition and Boolean connectives, we show two restrictions of the predicate abstraction problem where the two complexities match. The restrictions correspond to the case of monomial and clausal abstraction
An Overview of Rewrite Rule Laboratory (RRL)
 J. of Computer and Mathematics with Applications
, 1995
"... RRL (Rewrite Rule Laboratory) was originally developed as an environment for experimenting with automated reasoning algorithms for equational logic based on rewrite techniques. It has now matured into a fullfledged theorem prover which has been used to solve hard and challenging mathematical proble ..."
Abstract

Cited by 69 (24 self)
 Add to MetaCart
RRL (Rewrite Rule Laboratory) was originally developed as an environment for experimenting with automated reasoning algorithms for equational logic based on rewrite techniques. It has now matured into a fullfledged theorem prover which has been used to solve hard and challenging mathematical
Intersection formulas and algorithms for computing . . .
 MACIS
, 2009
"... Methods for computing triangular decompositions of polynomial systems can be classified into two groups. First, those computing a series of regular chains C1...,Ce such that for each irreducible component V of the variety of the input system, one of the Ci’s encodes a generic zero of V. An example i ..."
Abstract
 Add to MetaCart
is the algorithm of Michael Kalkbrener in his PhD thesis. Secondly are those methods computing a series of characteristic sets C1...,Cf (in the sense of Wu Wen Tsün) such that the variety of the input system is the union of the quasicomponents of the Ci’s. A large variety of methods fall in the second family
On the Word, Subsumption, and Complement Problems for Recurrent Term Schematizations
 In
, 1998
"... We investigate the word and the subsumption problems for recurrent term schematizations, which are a special type of constraints based on iteration. By means of unication, we reduce these problems to the 2 fragment of linear Diophantine equations over nonnegative integers. Our approach is applica ..."
Abstract

Cited by 2 (0 self)
 Add to MetaCart
is applicable to all recurrent term schematizations having a nitary unication algorithm. Furthermore, we study a particular form of the complement problem. Given a nite set of terms, we ask whether its complement can be nitely represented by schematizations, using only the equality predicate without negation
Automated Deduction: Decidability, Complexity, Tractability Proceedings
, 2009
"... This volume contains the joint proceedings of the 23rd International Unification Workshop (UNIF 2009), and of the Workshop “Automated Deduction: Decidability, Complexity, Tractability”, which were held on August 2, 2009, at the ..."
Abstract
 Add to MetaCart
This volume contains the joint proceedings of the 23rd International Unification Workshop (UNIF 2009), and of the Workshop “Automated Deduction: Decidability, Complexity, Tractability”, which were held on August 2, 2009, at the
The Learnability of Description Logics with Equality Constraints
 Machine Learning
, 1994
"... Although there is an increasing amount of experimental research on learning concepts expressed in firstorder logic, there are still relatively few formal results on the polynomial learnability of firstorder representations from examples. Most previous analyses in the pacmodel have focused on s ..."
Abstract

Cited by 37 (3 self)
 Add to MetaCart
;KLONEtype languages". Description logics are also subsets of predicate calculus, but are expressed using a different syntax, allowing a different set of syntactic restrictions to be explored. We first define a simple description logic, summarize some results on its expressive power, and then analyze its
Constraint Acquisition∗
"... Constraint programming is used to model and solve complex combinatorial problems. The modeling task requires some expertise in constraint programming. This requirement is a bottleneck to the broader uptake of constraint technology. Several approaches have been proposed to assist the nonexpert user ..."
Abstract
 Add to MetaCart
Constraint programming is used to model and solve complex combinatorial problems. The modeling task requires some expertise in constraint programming. This requirement is a bottleneck to the broader uptake of constraint technology. Several approaches have been proposed to assist the non
A Mechanization of Sorted HigherOrder Logic Based on the Resolution Principle
, 1994
"... The usage of sorts in firstorder automated deduction has brought greater conciseness of representation and a considerable gain in efficiency by reducing the search spaces involved. This suggests that sort information can be employed in higherorder theorem proving with similar results. This thesis ..."
Abstract

Cited by 27 (13 self)
 Add to MetaCart
present sets of transformations for sorted higherorder unification and preunification, and prove the nondeterministic completeness of the algorithm induced by these transformations. The
Under consideration for publication in Formal Aspects of Computing PropertyDirected Incremental Invariant Generation
"... Abstract. A fundamental method of analyzing a system such as a program or a circuit is invariance analysis, in which one proves that an assertion holds on all reachable states. Typically, the proof is performed via induction; however, an assertion, while invariant, may not be inductive (provable via ..."
Abstract
 Add to MetaCart
Abstract. A fundamental method of analyzing a system such as a program or a circuit is invariance analysis, in which one proves that an assertion holds on all reachable states. Typically, the proof is performed via induction; however, an assertion, while invariant, may not be inductive (provable
Results 1  10
of
61