Sciweavers

ICFP
2010
ACM
13 years 6 months ago
VeriML: typed computation of logical terms inside a language with effects
Modern proof assistants such as Coq and Isabelle provide high degrees of expressiveness and assurance because they support formal reasoning in higher-order logic and supply explic...
Antonis Stampoulis, Zhong Shao
CASC
2009
Springer
180views Mathematics» more  CASC 2009»
13 years 6 months ago
Effective Quantifier Elimination for Presburger Arithmetic with Infinity
We consider Presburger arithmetic extended by infinity. For this we give an effective quantifier elimination and decision procedure which implies also the completeness of our exten...
Aless Lasaruk, Thomas Sturm
IJCAI
1989
13 years 6 months ago
An Adaptive Model of Decision-Making in Planning
Learning how to make decisions in a domain is a critical aspect of intelligent planning behavior. The ability of a planner to adapt its decision-making to a domain depends in part...
Gregg Collins, Lawrence Birnbaum, Bruce Krulwich
IJCAI
1997
13 years 6 months ago
On Evaluating Decision Procedures for Modal Logic
This paper investigates the evaluation method of decision procedures for multi-modal logic proposed by Giunchiglia and Sebastiani as an adaptation from the evaluation method of Mi...
Ullrich Hustadt, Renate A. Schmidt
IJCAI
2001
13 years 6 months ago
Decision Procedures for Expressive Description Logics with Intersection, Composition, Converse of Roles and Role Identity
In the quest for expressive description logics for real-world applications, a powerful combination of constructs has so far eluded practical decision procedures: intersection and ...
Fabio Massacci
FROCOS
2000
Springer
13 years 8 months ago
Combining Equational Theories Sharing Non-Collapse-Free Constructors
In this paper we extend the applicability of our combination method for decision procedures for the word problem to theories sharing non-collapse-free constructors. This extension ...
Franz Baader, Cesare Tinelli
FSTTCS
2006
Springer
13 years 8 months ago
Validity Checking for Finite Automata over Linear Arithmetic Constraints
Abstract Decision procedures underlie many program analysis problems. Traditional program analysis algorithms attempt to prove some property about a single, statically-defined prog...
Gary Wassermann, Zhendong Su
CTRS
1990
13 years 9 months ago
Completion Procedures as Semidecision Procedures
Completion procedures, originated from the seminal work of Knuth and Bendix, are wellknown as procedures for generating confluent rewrite systems, i.e. decision procedures for al ...
Maria Paola Bonacina, Jieh Hsiang
LOPSTR
1998
Springer
13 years 9 months ago
Using Decision Procedures to Accelerate Domain-Specific Deductive Synthesis Systems
This paper describes a class of decision procedures that we have found useful for efficient, domain-specific deductive synthesis, and a method for integrating this type of procedur...
Jeffrey Van Baalen, Steve Roach
FTP
1998
Springer
13 years 9 months ago
Issues of Decidability for Description Logics in the Framework of Resolution
Abstract. We describe two methods on the basis of which efficient resolution decision procedures can be developed for a range of description logics. The first method uses an orderi...
Ullrich Hustadt, Renate A. Schmidt