Search Sciweavers | Sciweavers

2022 search results - page 5 / 405

» Complexity of Non-Monotonic Logics

click to vote

TCS
2011

163views Theoretical Computer Science» more TCS 2011»

Realizability models and implicit complexity

13 years 4 months ago

Download perso.ens-lyon.fr

New, simple, proofs of soundness (every representable function lies in a given complexity class) for Elementary Aﬃne Logic, LFPL and Soft Aﬃne Logic are presented. The proofs ...

Ugo Dal Lago, Martin Hofmann

claim paper

Read More »

click to vote

FUIN
2010

106views more FUIN 2010»

Horn Knowledge Bases in Regular Description Logics with PTIME Data Complexity

13 years 7 months ago

Download www.mimuw.edu.pl

Abstract. Developing a good formalism and an efficient decision procedure for the instance checking problem is desirable for practical application of description logics. The data c...

Linh Anh Nguyen

claim paper

Read More »

click to vote

JAPLL
2010

111views more JAPLL 2010»

The complexity of satisfiability for fragments of hybrid logic - Part I

13 years 4 months ago

Download www.thi.uni-hannover.de

The satisfiability problem of hybrid logics with the downarrow binder is known to be undecidable. This initiated a research program on decidable and tractable fragments. In this p...

Arne Meier, Martin Mundhenk, Thomas Schneider 0002...

claim paper

Read More »

click to vote

IJCV
2011

63views more IJCV 2011»

Predicate Logic Based Image Grammars for Complex Pattern Recognition

13 years 1 months ago

Download umiacs.umd.edu

Vinay D. Shet, Maneesh Singh, Claus Bahlmann, Visv...

claim paper

Read More »