Sciweavers

1302 search results - page 10 / 261
» Deductive Plan Generation
Sort
View
CP
2005
Springer
13 years 9 months ago
Using Boolean Constraint Propagation for Sub-clauses Deduction
Boolean Constraint Propagation (BCP) is recognized as one of the most useful technique for efficient satisfiability checking. In this paper a new extension of the scope of boole...
Sylvain Darras, Gilles Dequen, Laure Devendeville,...
CORR
2006
Springer
116views Education» more  CORR 2006»
13 years 7 months ago
Rewriting modulo in Deduction modulo
Abstract. We study the termination of rewriting modulo a set of equations in the Calculus of Algebraic Constructions, an extension of the Calculus of Constructions with functions a...
Frédéric Blanqui
CADE
2004
Springer
14 years 7 months ago
The ICS Decision Procedures for Embedded Deduction
contexts such as construction of abstractions, speed may be favored over completeness, so that undecidable theories (e.g., nonlinear integer arithmetic) and those whose decision pr...
Leonardo Mendonça de Moura, Sam Owre, Haral...
ECP
1997
Springer
108views Robotics» more  ECP 1997»
13 years 11 months ago
Contingency Selection in Plan Generation
Akey question in conditional planning is: howmany, and whichof the possible executionfailures shouldbe plannedfor? Onecannot, in general, plan for all the possiblefailures because...
Nilufer Onder, Martha E. Pollack
KI
2004
Springer
14 years 26 days ago
A Pragmatics-First Approach to the Analysis and Generation of Dialogues
Integration of new utterances into context is a central task in any model for rational (human-machine) dialogues in natural language. In this paper, a pragmatics-first approach to...
Bernd Ludwig