714 search results - page 126 / 143 » Lexicographically-ordered constraint satisfaction problems |
118
click to vote
CORR
1998
Springer
14 years 11 months ago
1998
Springer
In this paper we reexamine the place and role of stable model semantics in logic programming and contrast it with a least Herbrand model approach to Horn programs. We demonstrate ...
IJIIDS
2010
14 years 10 months ago
2010
With the advent of XML as a data representation and exchange format over the web, a massive amount of data is being stored in XML. The task of data transformation for integration ...
TALG
2010
14 years 10 months ago
2010
Fractional hypertree width is a hypergraph measure similar to tree width and hypertree width. Its algorithmic importance comes from the fact that, as shown in previous work [14], ...
CP
2007
Springer
15 years 5 months ago
2007
Springer
It is known that Constraint Satisfaction Problems (CSP) can be converted into Boolean Satisfiability problems (SAT); however how to encode a CSP into a SAT problem such that a SAT...
GECCO
2004
Springer
15 years 5 months ago
2004
Springer
The optimization of the epoxy polymerization process involves a number of conflicting objectives and more than twenty decision parameters. In this paper, the problem is treated tr...