Sciweavers

72 search results - page 6 / 15
» On a syntactic approximation to logics that capture complexi...
Sort
View
ENTCS
2006
117views more  ENTCS 2006»
13 years 7 months ago
Monadic Second-Order Logic and Transitive Closure Logics over Trees
Model theoretic syntax is concerned with studying the descriptive complexity of grammar formalisms for natural languages by defining their derivation trees in suitable logical for...
Hans-Jörg Tiede, Stephan Kepser
CIE
2007
Springer
14 years 1 months ago
Computational Complexity of Constraint Satisfaction
Abstract. The input to a constraint satisfaction problem (CSP) consists of a set of variables, each with a domain, and constraints between these variables formulated by relations o...
Heribert Vollmer
MFCS
2009
Springer
14 years 1 months ago
Synthesis for Structure Rewriting Systems
Abstract. The description of a single state of a modelled system is often complex in practice, but few procedures for synthesis address this problem in depth. We study systems in w...
Lukasz Kaiser
AAAI
2008
13 years 9 months ago
Factored Models for Probabilistic Modal Logic
Modal logic represents knowledge that agents have about other agents' knowledge. Probabilistic modal logic further captures probabilistic beliefs about probabilistic beliefs....
Afsaneh Shirazi, Eyal Amir
ESWS
2007
Springer
14 years 1 months ago
Acquisition of OWL DL Axioms from Lexical Resources
State-of-the-art research on automated learning of ontologies from text currently focuses on inexpressive ontologies. The acquisition of complex axioms involving logical connective...
Johanna Völker, Pascal Hitzler, Philipp Cimia...