Sciweavers

9719 search results - page 253 / 1944
» Answer Set Optimization
Sort
View
EACL
2009
ACL Anthology
15 years 4 months ago
Optimization in Coreference Resolution is not Needed: A Nearly-Optimal Algorithm with Intensional Constraints
We show how global constraints such as transitivity can be treated intensionally in a Zero-One Integer Linear Programming (ILP) framework which is geared to find the optimal and c...
Manfred Klenner, Étienne Ailloud
STACS
2009
Springer
16 years 1 months ago
Forward Analysis for WSTS, Part I: Completions
Well-structured transition systems provide the right foundation to compute a finite basis of the set of predecessors of the upward closure of a state. The dual problem, to compute...
Alain Finkel, Jean Goubault-Larrecq
COSIT
2009
Springer
165views GIS» more  COSIT 2009»
16 years 1 months ago
To Be and Not To Be: 3-Valued Relations on Graphs
Spatial information requires models which allow us to answer ‘maybe’ to questions asking whether a location lies within a region. At the same time, models must account for data...
John G. Stell
CLIMA
2004
15 years 8 months ago
Revising Knowledge in Multi-agent Systems Using Revision Programming with Preferences
In this paper we extend the Revision Programming framework--a logic-based framework to express and maintain constraints on knowledge bases-with different forms of preferences. Pref...
Inna Pivkina, Enrico Pontelli, Tran Cao Son
PROPERTYTESTING
2010
15 years 4 months ago
On Constant Time Approximation of Parameters of Bounded Degree Graphs
How well can the maximum size of an independent set, or the minimum size of a dominating set of a graph in which all degrees are at most d be approximated by a randomized constant...
Noga Alon