105
click to vote
ECAI
2006
Springer
15 years 6 months ago
2006
Springer
Minimally unsatisfiable subformulas (in short, MUSes) represent the smallest explanations for the inconsistency of SAT instances in terms of the number of involved clauses. Extract...
118
click to vote
ECAI
2006
Springer
15 years 6 months ago
2006
Springer
Abstract. We address the problem of extracting Minimal Unsatisfiable Cores (MUCs) from constraint networks. This computationally hard problem has a practical interest in many appli...
112
click to vote
ECAI
2006
Springer
15 years 6 months ago
2006
Springer
Abstract. Alternating-offers is the most prominent negotiation protocol for automatic bilateral bargaining. Nevertheless, in most settings it is still not known how two fully ratio...
129
click to vote
ECAI
2006
Springer
15 years 6 months ago
2006
Springer
Semantic matching determines the mappings between the nodes of two graphs (e.g., ontologies) by computing logical relations (e.g., subsumption) holding among the nodes that corresp...
131
click to vote
ECAI
2006
Springer
15 years 6 months ago
2006
Springer
This article describes a semantic parser based on FrameNet semantic roles that uses a broad knowledge base created by interconnecting three major resources: FrameNet, VerbNet and P...