Sciweavers

295 search results - page 2 / 59
» Approximating the Expressive Power of Logics in Finite Model...
Sort
View
AAAI
2006
15 years 1 months ago
Characterizing Data Complexity for Conjunctive Query Answering in Expressive Description Logics
Description Logics (DLs) are the formal foundations of the standard web ontology languages OWL-DL and OWL-Lite. In the Semantic Web and other domains, ontologies are increasingly ...
Magdalena Ortiz, Diego Calvanese, Thomas Eiter
TCIAIG
2010
14 years 6 months ago
The Parametrized Probabilistic Finite-State Transducer Probe Game Player Fingerprint Model
Abstract--Fingerprinting operators generate functional signatures of game players and are useful for their automated analysis independent of representation or encoding. The theory ...
Jeffrey Tsang
DIAGRAMS
2004
Springer
15 years 3 months ago
What Can Spider Diagrams Say?
Spider diagrams are a visual notation for expressing logical statements. In this paper we identify a well known fragment of first order predicate logic, that we call ESD, equivalen...
Gem Stapleton, John Howse, John Taylor, Simon J. T...
CSL
2007
Springer
15 years 5 months ago
The Power of Counting Logics on Restricted Classes of Finite Structures
Abstract. Although Cai, F¨urer and Immerman have shown that fixedpoint logic with counting (IFP + C) does not express all polynomialtime properties of finite structures, there h...
Anuj Dawar, David Richerby
ECOOP
2009
Springer
16 years 9 days ago
Coinductive Type Systems for Object-Oriented Languages
We propose a novel approach based on coinductive logic to specify type systems of programming languages. The approach consists in encoding programs in Horn formulas which are inter...
Davide Ancona, Giovanni Lagorio