Sciweavers

3793 search results - page 474 / 759
» Expressive Description Logics
Sort
View
STOC
2009
ACM
106views Algorithms» more  STOC 2009»
16 years 7 months ago
Random graphs and the parity quantifier
The classical zero-one law for first-order logic on random graphs says that for every first-order property in the theory of graphs and every p (0, 1), the probability that the r...
Phokion G. Kolaitis, Swastik Kopparty
CADE
2002
Springer
16 years 7 months ago
The Reflection Theorem: A Study in Meta-theoretic Reasoning
The reflection theorem has been proved using Isabelle/ZF. This theorem cannot be expressed in ZF, and its proof requires reasoning at the meta-level. There is a particularly elegan...
Lawrence C. Paulson
CADE
2001
Springer
16 years 7 months ago
Automated Incremental Termination Proofs for Hierarchically Defined Term Rewriting Systems
We propose the notion of rewriting modules in order to provide a structural and hierarchical approach of TRS. We define then relative dependency pairs built upon these modules whic...
Xavier Urbain
ICMT
2009
Springer
16 years 1 months ago
Pattern-Based Model-to-Model Transformation: Handling Attribute Conditions
Abstract. Pattern-based model-to-model transformation is a new approach for specifying transformations in a declarative, relational and formal style. The language relies on pattern...
Esther Guerra, Juan de Lara, Fernando Orejas
IAT
2008
IEEE
16 years 1 months ago
Time and Defeasibility in FIPA ACL Semantics
Inferences about speech acts are often conditional, nonmonotonic, and involve the issue of time. Most agent communication languages, however, ignore these issues, due to the difï¬...
Guido Boella, Guido Governatori, Joris Hulstijn, R...