Sciweavers

39 search results - page 5 / 8
» Inferring Disjunctive Postconditions
Sort
View
SAS
2009
Springer
162views Formal Methods» more  SAS 2009»
14 years 9 months ago
Interval Polyhedra: An Abstract Domain to Infer Interval Linear Relationships
Polyhedra: An Abstract Domain to Infer Interval Linear Relationships Liqian Chen1,2 , Antoine Min?e2,3 , Ji Wang1 , and Patrick Cousot2,4 1 National Laboratory for Parallel and Dis...
Antoine Miné, Ji Wang, Liqian Chen, Patrick...
SLP
1989
87views more  SLP 1989»
13 years 9 months ago
Partial Evaluation in Prolog: Some Improvements about Cut
Two main aspects of Partial Evaluation for Prolog programs are considered: treatment of cuts and control of recursion. The analysis about cut is exhaustive: we consider occurrence...
Michele Bugliesi, F. Russo
JAIR
2006
106views more  JAIR 2006»
13 years 8 months ago
Clause/Term Resolution and Learning in the Evaluation of Quantified Boolean Formulas
Resolution is the rule of inference at the basis of most procedures for automated reasoning. In these procedures, the input formula is first translated into an equisatisfiable for...
Enrico Giunchiglia, Massimo Narizzano, Armando Tac...
JELIA
2000
Springer
14 years 3 days ago
An Algorithmic Approach to Recover Inconsistent Knowledge-Bases
Abstract. We consider an algorithmic approach for revising inconsistent data and restoring its consistency. This approach detects the\spoiled" part of the data (i.e., the set ...
Ofer Arieli
ECP
1997
Springer
92views Robotics» more  ECP 1997»
14 years 21 days ago
Understanding and Extending Graphplan
We provide a reconstruction of Blum and Furst’s Graphplan algorithm, and use the reconstruction to extend and improve the original algorithm in several ways. In our reconstructi...
Subbarao Kambhampati, Eric Parker, Eric Lambrecht