Sciweavers

186 search results - page 20 / 38
» Tractability of Theory Patching
Sort
View
EACL
1989
ACL Anthology
14 years 11 months ago
Inference in DATR
DATR is a declarative language for representing a restricted class of inheritance networks, permitting both multiple and default inheritance. The principal intended area of applic...
Roger Evans, Gerald Gazdar
AMAI
2006
Springer
14 years 10 months ago
Bargaining over multiple issues in finite horizon alternating-offers protocol
In this paper we study multi issue alternating-offers bargaining in a perfect information finite horizon setting, we determine the pertinent subgame perfect equilibrium, and we pro...
Francesco Di Giunta, Nicola Gatti
JANCL
2006
123views more  JANCL 2006»
14 years 10 months ago
Approximate databases: a support tool for approximate reasoning
This paper describes an experimental platform for approximate knowledge databases called the Approximate Knowledge Database (AKDB), based on a semantics inspired by rough sets. The...
Patrick Doherty, Martin Magnusson, Andrzej Szalas
ATMOS
2010
136views Optimization» more  ATMOS 2010»
14 years 9 months ago
An Empirical Analysis of Robustness Concepts for Timetabling
Calculating timetables that are insensitive to disturbances has drawn considerable research efforts due to its practical importance on the one hand and its hard tractability by c...
Marc Goerigk, Anita Schöbel
DLOG
2010
14 years 8 months ago
Updating TBoxes in DL-Lite
Abstract. We study the problem of updates for TBoxes represented in Description Logics of the DL-Lite family. DL-Lite is at the basis of OWL 2 QL, one of the tractable fragments of...
Dmitriy Zheleznyakov, Diego Calvanese, Evgeny Khar...