Sciweavers

226 search results - page 10 / 46
» BDDs and Automated Deduction
Sort
View
LACL
1998
Springer
13 years 11 months ago
Deductions with Meaning
In this paper, we consider some of the problems that arise if automated reasoning methods are applied to natural language semantics. It turns that out that the problem of ambiguity...
Christof Monz, Maarten de Rijke
LOPSTR
2000
Springer
13 years 11 months ago
A formal framework for synthesis and verification of logic programs
In this paper we will present a formal framework, based on the notion of extraction calculus, which has been successfully applied to define procedures for extracting information fr...
Alessandro Avellone, Mauro Ferrari, Camillo Fioren...
CADE
2008
Springer
14 years 7 months ago
Challenges in the Automated Verification of Security Protocols
Abstract. The application area of security protocols raises several problems that are relevant to automated deduction. We describe in this note some of these challenges.
Hubert Comon-Lundh
ENTCS
2006
169views more  ENTCS 2006»
13 years 7 months ago
Constructing Induction Rules for Deductive Synthesis Proofs
We describe novel computational techniques for constructing induction rules for deductive synthesis proofs. Deductive synthesis holds out the promise of automated construction of ...
Alan Bundy, Lucas Dixon, Jeremy Gow, Jacques D. Fl...
LOPSTR
1998
Springer
13 years 11 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