Sciweavers

1664 search results - page 233 / 333
» Towards Partial Reasoning
Sort
View
CICLING
2007
Springer
16 years 16 days ago
Dependency Analysis and CBR to Bridge the Generation Gap in Template-Based NLG
The present paper describes how dependency analysis can be used to automatically extract from a corpus a set of cases - and an accompanying vocabulary - which enable a template-bas...
Virginia Francisco, Raquel Hervás, Pablo Ge...
LICS
2006
IEEE
16 years 10 days ago
Provable Implementations of Security Protocols
for reasoning about abstract models of protocols. The work on informal methods attempts to discern common patterns in the extensive record of flawed protocols, and to formulate po...
Andrew D. Gordon
ECAI
2004
Springer
15 years 11 months ago
Guiding a Theorem Prover with Soft Constraints
Attempts to use finite models to guide the search for proofs by resolution and the like in first order logic all suffer from the need to trade off the expense of generating and m...
John K. Slaney, Arnold Binas, David Price
AGP
2003
IEEE
15 years 11 months ago
Interpreting Abduction in CLP
Constraint Logic Programming (CLP) and Abductive Logic Programming (ALP) share the important concept of conditional answer. We exploit their deep similarities to implement an effic...
Marco Gavanelli, Evelina Lamma, Paola Mello, Miche...
DISOPT
2007
81views more  DISOPT 2007»
15 years 6 months ago
Strong polynomiality of resource constraint propagation
Constraint-based schedulers have been widely successful to tackle complex, disjunctive and cumulative, scheduling applications by combining tree search and constraint propagation....
Luc Mercier, Pascal Van Hentenryck