E-Books durchsuchen
Logic for Programming, Artificial Intelligence, and Reasoning [2007]
- 1
-
From Hilbert’s Program to a Logic Toolbox
- 15
-
Whatever Happened to Deductive Question Answering?
- 123
-
Completeness and Decidability in Sequence Logic
- 257
-
Preferential Description Logics
- 273
-
On Two Extensions of Abstract Categorial Grammars
- 318
-
On Finite Satisfiability of the Guarded Fragment with Equivalence or Transitive Guards
- 333
-
Data Complexity in the <InlineEquation ID="IEq1"> <InlineMediaObject> <ImageObject Color="BlackWhite" FileRef="978-3-540-75560-9_25_Chapter_TeX2GIFIEq1.gif" Format="GIF" Rendition="HTML" Type="Linedraw" /> </InlineMediaObject> <EquationSource Format="TEX">$\mathcal{EL}$</EquationSource> </InlineEquation> Family of Description Logics
- 363
-
Retractile Proof Nets of the Purely Multiplicative and Additive Fragment of Linear Logic
- 393
-
The Separation Theorem for Differential Interaction Nets
- 469
-
Permutative Additives and Exponentials
- 499
-
Completeness for Flat Modal Fixpoint Logics
- 531
-
The Complexity of Temporal Logic with Until and Since over Ordinals
- 546
-
ATP Cross-Verification of the Mizar MPTP Challenge Problems
