Sciweavers

CSR
2009
Springer
13 years 6 months ago
Approximability of the Maximum Solution Problem for Certain Families of Algebras
We study the approximability of the maximum solution problem. This problem is an optimisation variant of the constraint satisfaction problem and it captures a wide range of interes...
Peter Jonsson, Johan Thapper
AIPS
2009
13 years 6 months ago
Extended Goals for Composing Services
The ability to automatically compose Web Services is critical for realising more complex functionalities. Several proposals to use automated planning to deal with the problem of s...
Eirini Kaldeli, Alexander Lazovik, Marco Aiello
IJCAI
1989
13 years 6 months ago
Constraint Satisfaction with Delayed Evaluation
This paper describes the design and implementation of a constraint satisfaction system that uses delayed evaluation techniques to provide greater representational power and to avo...
Monte Zweben, Megan Eskey
ACL
1990
13 years 6 months ago
Structural Disambiguation with Constraint Propagation
We present a new grammatical formalism called Constraint Dependency Grammar (CDG) in which every grammatical rule is given as a constraint on wordto-word modifications. CDG parsin...
Hiroshi Maruyama
IJCAI
1993
13 years 6 months ago
Domain Filtering can Degrade Intelligent Backtracking Search
This paper presents an improved backjumping algonthm for the constraint satisfaction problem, namely conflictdirected backjumping (CBJ). CBJ is then modified such that it can dete...
Patrick Prosser
AAAI
1994
13 years 6 months ago
An Approach to Multiply Segmented Constraint Satisfaction Problems
This paper describes an extension to the constraint satisfaction problem (CSP) approach called MUSE CSP (Multiply SEgmented Constraint Satisfaction Problem). This extension is esp...
Randall A. Helzerman, Mary P. Harper
AAAI
1997
13 years 6 months ago
Bayes Networks for Estimating the Number of Solutions to a CSP
The problem of counting the number of solutions to a constraint satisfaction problem (CSP) is rephrased in terms of probability updating in Bayes networks. Approximating the proba...
Amnon Meisels, Solomon Eyal Shimony, Gadi Solotore...
COLING
2000
13 years 6 months ago
Planning texts by constraint satisfaction
A method is de.scribed by which a rhetoricalstructure tree can be realized by a text structure made up of sections, paragraphs, sentences, vertical lists, mid other textual patter...
Richard Power
NAACL
2003
13 years 6 months ago
Language choice models for microplanning and readability
This paper describes the construction of language choice models for the microplanning of discourse relations in a Natural Language Generation system that attempts to generate appr...
Sandra Williams
IADIS
2003
13 years 6 months ago
Adaptive Hypermedia Systems Featuring Information Customization Using Constraint Satisfaction Methods
We present an Information Customization framework, which offers a unique hybrid of Adaptive Hypermedia and Constraint Satisfaction methods. IC is being modelled as a constraint sa...
Chong Yan Han, Syed Sibte Raza Abidi, Yu-N Cheah