Sciweavers

2035 search results - page 22 / 407
» On the complexity of stratified logics
Sort
View
FUIN
2007
134views more  FUIN 2007»
14 years 10 months ago
Complexity Issues in Multiagent Logics
Abstract. Our previous research presents a methodology of cooperative problem solving for beliefdesire-intention (BDI) systems, based on a complete formal theory called TEAMLOG. Th...
Marcin Dziubinski, Rineke Verbrugge, Barbara Dunin...
SAT
2010
Springer
178views Hardware» more  SAT 2010»
15 years 2 months ago
Proof Complexity of Propositional Default Logic
Default logic is one of the most popular and successful formalisms for non-monotonic reasoning. In 2002, Bonatti and Olivetti introduced several sequent calculi for credulous and s...
Olaf Beyersdorff, Arne Meier, Sebastian Mülle...
95
Voted
DLOG
1996
14 years 11 months ago
Number Restrictions on Complex Roles in Description Logics: A Preliminary Report
Number restrictions are concept constructors that are available in almost all implemented description logic systems. However, even though there has lately been considerable effort...
Franz Baader, Ulrike Sattler
LMCS
2007
132views more  LMCS 2007»
14 years 10 months ago
The Complexity of Model Checking Higher-Order Fixpoint Logic
Higher-Order Fixpoint Logic (HFL) is a hybrid of the simply typed λ-calculus and the modal µ-calculus. This makes it a highly expressive temporal logic that is capable of express...
Roland Axelsson, Martin Lange, Rafal Somla
70
Voted
FLAIRS
2003
14 years 11 months ago
On the Computational Complexity of Spatio-Temporal Logics
Recently, a hierarchy of spatio-temporal languages based on the propositional temporal logic PTL and the spatial languages RCC-8, BRCC-8 and S4u has been introduced. Although a nu...
David Gabelaia, Roman Kontchakov, Agi Kurucz, Fran...