Sciweavers

11051 search results - page 123 / 2211
» An Investigation of Generalized Cases
Sort
View
ESA
2003
Springer
124views Algorithms» more  ESA 2003»
14 years 3 months ago
The Minimum Generalized Vertex Cover Problem
Let G = (V, E) be an undirected graph, with three numbers d0(e) ≥ d1(e) ≥ d2(e) ≥ 0 for each edge e ∈ E. A solution is a subset U ⊆ V and di(e) represents the cost contr...
Refael Hassin, Asaf Levin
ECSQARU
2001
Springer
14 years 3 months ago
General Preferential Entailments as Circumscriptions
Abstract A (general) preferential entailment is defined by a “preference relation” among “states”. States can be either interpretations or sets of interpretations, or “c...
Yves Moinard
FOSSACS
1998
Springer
14 years 2 months ago
Generalizing Domain Theory
Abstract. Domain theory began in an attempt to provide mathematical models for high-level programming languages, an area where it has proved to be particularly useful. It is perhap...
Michael W. Mislove
ATAL
2007
Springer
14 years 2 months ago
A unified and general framework for argumentation-based negotiation
This paper proposes a unified and general framework for argumentation-based negotiation, in which the role of argumentation is formally analyzed. The framework makes it possible t...
Leila Amgoud, Yannis Dimopoulos, Pavlos Moraitis
ERSHOV
2006
Springer
14 years 18 days ago
Verifying Generalized Soundness of Workflow Nets
We improve the decision procedure from [10] for the problem of generalized soundness of workflow nets. A workflow net is generalized sound iff every marking reachable from an initi...
Kees M. van Hee, Olivia Oanea, Natalia Sidorova, M...