Sciweavers

2022 search results - page 104 / 405
» Complexity of Non-Monotonic Logics
Sort
View
122
Voted
FOCS
1998
IEEE
15 years 5 months ago
The Complexity of Acyclic Conjunctive Queries
This paper deals with the evaluation of acyclic Boolean conjunctive queries in relational databases. By well-known results of Yannakakis [1981], this problem is solvable in polynom...
Georg Gottlob, Nicola Leone, Francesco Scarcello
ENVSOFT
2007
166views more  ENVSOFT 2007»
15 years 22 days ago
The implications of complexity for integrated resources management
: Integrated environmental resources management is a purposeful activity with the goal to maintain and improve the state of an environmental resource affected by human activities. ...
C. Pahl-Wostl
ATAL
2008
Springer
15 years 2 months ago
Quantifying over coalitions in epistemic logic
Some natural epistemic properties which may arise in applications can only be expressed in standard epistemic logic by formulae which are exponentially long in the number of agent...
Thomas Ågotnes, Wiebe van der Hoek, Michael ...
ECAI
2008
Springer
15 years 2 months ago
Structure Learning of Markov Logic Networks through Iterated Local Search
Many real-world applications of AI require both probability and first-order logic to deal with uncertainty and structural complexity. Logical AI has focused mainly on handling com...
Marenglen Biba, Stefano Ferilli, Floriana Esposito
120
Voted
IANDC
2008
122views more  IANDC 2008»
15 years 25 days ago
Automata can show PSpace results for description logics
In the area of Description Logic (DL), both tableau-based and automata-based algorithms are frequently used to show decidability and complexity results for basic inference problem...
Franz Baader, Jan Hladik, Rafael Peñaloza