476 search results - page 82 / 96 » The Complexity of Equality Constraint Languages |
186
click to vote
ICLP
2009
Springer
16 years 10 days ago
2009
Springer
This paper considers a semantic approach for merging logic programs under answer set semantics. Given logic programs P1, . . . , Pn, the goal is to provide characterisations of the...
COORDINATION
2007
Springer
15 years 5 months ago
2007
Springer
Connectors have emerged as a powerful concept for composition and coordination of concurrent activities encapsulated as components and services. Compositional coordination models a...
CP
2005
Springer
15 years 5 months ago
2005
Springer
QBF is the problem of deciding the satisfiability of quantified boolean formulae in which variables can be either universally or existentially quantified. QBF generalizes SAT (S...
106
click to vote
ISMVL
2000
IEEE
15 years 4 months ago
2000
IEEE
Signed conjunctive normal form (signed CNF) is a classical conjunctive clause form using a generalized notion of literal, called signed atom. A signed atom is an expression of the...
CIT
2007
Springer
15 years 3 months ago
2007
Springer
Existence of crosscutting concerns in software requirements often intensifies complexity of software development. Modeling and analysis of these concerns at software architecture ...