Sciweavers

1757 search results - page 100 / 352
» Alternating Refinement Relations
Sort
View
122
Voted
CIAC
2010
Springer
263views Algorithms» more  CIAC 2010»
16 years 18 days ago
The Complexity of Computing Minimal Unidirectional Covering Sets
Abstract. Given a binary dominance relation on a set of alternatives, a common thread in the social sciences is to identify subsets of alternatives that satisfy certain notions of ...
Dorothea Baumeister, Felix Brandt, Felix Fischer, ...
ICCBR
2003
Springer
15 years 8 months ago
Case-Based Ranking for Decision Support Systems
Abstract. Very often a planning problem can be formulated as a ranking problem: i.e. to find an order relation over a set of alternatives. The ranking of a finite set of alternat...
Paolo Avesani, Sara Ferrari, Angelo Susi
FOSSACS
2008
Springer
15 years 4 months ago
A Modal Deconstruction of Access Control Logics
We present a translation from a logic of access control with a "says" operator to the classical modal logic S4. We prove that the translation is sound and complete. We al...
Deepak Garg, Martín Abadi
FOIS
2006
15 years 4 months ago
A Reusable Ontology for Fluents in OWL
A critical problem for practical KR is dealing with relationships that change over time. This problem is compounded by representation languages such as OWL that are biased towards ...
Christopher A. Welty, Richard Fikes
AAAI
1994
15 years 4 months ago
Spatial Reasoning in Indeterminate Worlds
A possible worlds semantics for model-based spatial reasoning is presented. In this semantics, worlds are characterized by the alternative states that result from indeterminacy or...
Janice I. Glasgow