110 search results - page 7 / 22 » Complexity Classes as Mathematical Axioms |
189
click to vote
FROCOS
2007
Springer
16 years 15 hour ago
2007
Springer
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...
188
click to vote
FUN
2010
Springer
15 years 10 months ago
2010
Springer
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...
196
click to vote
WWW
2011
ACM
15 years 24 days ago
2011
ACM
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...
185
click to vote
LICS
2006
IEEE
15 years 12 months ago
2006
IEEE
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...
156
click to vote
FROCOS
2007
Springer
16 years 15 hour ago
2007
Springer
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:...