Sciweavers

110 search results - page 7 / 22
» Complexity Classes as Mathematical Axioms
Sort
View
FROCOS
2007
Springer
15 years 4 months ago
Hierarchical and Modular Reasoning in Complex Theories: The Case of Local Theory Extensions
Abstract. We present an overview of results on hierarchical and modular reasoning in complex theories. We show that for a special type of extensions of a base theory, which we call...
Viorica Sofronie-Stokkermans
FUN
2010
Springer
293views Algorithms» more  FUN 2010»
15 years 2 months ago
Computational Complexity of Two-Dimensional Platform Games
Abstract. We analyze the computational complexity of various twodimensional platform games. We identify common properties of these games that allow us to state several meta-theorem...
Michal Forisek
WWW
2011
ACM
14 years 5 months ago
A better uncle for OWL: nominal schemas for integrating rules and ontologies
We propose a description-logic style extension of OWL 2 with nominal schemas which can be used like“variable nominal classes”within axioms. This feature allows ontology langua...
Markus Krötzsch, Frederick Maier, Adila Krisn...
102
Voted
LICS
2006
IEEE
15 years 4 months ago
PSPACE Bounds for Rank-1 Modal Logics
aic semantics, which conveniently abstracts from the details of a given model class and thus allows covering a broad range of logics in a uniform way. Categories and Subject Descri...
Lutz Schröder, Dirk Pattinson
FROCOS
2007
Springer
15 years 4 months ago
Languages Modulo Normalization
Abstract. We propose a new class of tree automata, called tree automata with normalization (TAN). This framework extends equational tree automata, and improved the results of them:...
Hitoshi Ohsaki, Hiroyuki Seki