Sciweavers

3044 search results - page 281 / 609
» Linear logical approximations
Sort
View
LMCS
2007
132views more  LMCS 2007»
15 years 6 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
MSCS
2007
125views more  MSCS 2007»
15 years 6 months ago
On categorical models of classical logic and the Geometry of Interaction
It is well-known that weakening and contraction cause na¨ıve categorical models of the classical sequent calculus to collapse to Boolean lattices. In previous work, summarized b...
Carsten Führmann, David J. Pym
JAPLL
2010
141views more  JAPLL 2010»
15 years 5 months ago
Algebraic tableau reasoning for the description logic SHOQ
Semantic web applications based on the web ontology language (OWL) often require the use of numbers in class descriptions for expressing cardinality restrictions on properties or ...
Jocelyne Faddoul, Volker Haarslev
EUROCOLT
1999
Springer
15 years 11 months ago
Mind Change Complexity of Learning Logic Programs
The present paper motivates the study of mind change complexity for learning minimal models of length-bounded logic programs. It establishes ordinal mind change complexity bounds ...
Sanjay Jain, Arun Sharma
PLANX
2007
15 years 8 months ago
XML Transformation Language Based on Monadic Second Order Logic
Although monadic second-order logic (MSO) has been a foundation of XML queries, little work has attempted to take MSO formulae themselves as a programming construct. Indeed, MSO f...
Kazuhiro Inaba, Haruo Hosoya