2022 search results - page 224 / 405 » Complexity of Non-Monotonic Logics |
172
Voted
ICFP
2010
ACM
15 years 7 months ago
2010
ACM
Reasoning about program equivalence is one of the oldest problems in semantics. In recent years, useful techniques have been developed, based on bisimulations and logical relation...
160
click to vote
JAIR
2008
15 years 6 months ago
2008
Shapley's impossibility result indicates that the two-person bargaining problem has no non-trivial ordinal solution with the traditional game-theoretic bargaining model. Alth...
168
click to vote
CP
2010
Springer
15 years 4 months ago
2010
Springer
Abstract. We study the lattice structure of sets (monoids) of surjective hyper-operations on an n-element domain. Through a Galois connection, these monoids form the algebraic coun...
183
click to vote
DEXAW
2009
IEEE
16 years 1 months ago
2009
IEEE
One of the main limitations in using ontologies in modern information systems is due to the fact that the design and maintenance of ontologies is a complex activity that requires ...
144
click to vote
ICCS
2009
Springer
16 years 1 months ago
2009
Springer
This paper is an extended abstract of the talk given at ICCS’09. Rules have long been considered as an essential component of knowledge-based systems. We focus here on conceptual...