Sciweavers

8 search results - page 1 / 2
» Problem of restricted interpolation in superintuitionistic a...
Sort
View
78
Voted
AML
2007
95views more  AML 2007»
14 years 11 months ago
Complexity of admissible rules
We investigate the computational complexity of deciding whether a given inference rule is admissible for some modal and superintuitionistic logics. We state a broad condition unde...
Emil Jerábek
113
Voted
PLANX
2007
15 years 9 days ago
XPath Typing Using a Modal Logic with Converse for Finite Trees
We present an algorithm to solve XPath decision problems under regular tree type constraints and show its use to statically typecheck XPath queries. To this end, we prove the deci...
Pierre Genevès, Nabil Layaïda, Alan Sc...
82
Voted
LOGCOM
2008
94views more  LOGCOM 2008»
14 years 11 months ago
Preservation of Interpolation Features by Fibring
Fibring is a metalogical constructor that permits to combine different logics by operating on their deductive systems under certain natural restrictions, as for example that the t...
Walter Alexandre Carnielli, João Rasga, Cri...
93
Voted
RWEB
2009
Springer
15 years 5 months ago
Description Logics
In this chapter we will introduce description logics, a family of logic-based knowledge representation languages that can be used to represent the terminological knowledge of an a...
Franz Baader