Sciweavers

4401 search results - page 718 / 881
» Computing with Default Logic
Sort
View
CORR
2008
Springer
91views Education» more  CORR 2008»
13 years 10 months ago
Taming Modal Impredicativity: Superlazy Reduction
Pure, or type-free, Linear Logic proof nets are Turing complete once cut-elimination is5 considered as computation. We introduce modal impredicativity as a new form of impredicati...
Ugo Dal Lago, Luca Roversi, Luca Vercelli
ECEASST
2008
121views more  ECEASST 2008»
13 years 10 months ago
Analyzing Semantic Properties of OCL Operations by Uncovering Interoperational Relationships
The OCL (Object Constraint Language) as part of the UML (Unified Modeling Language) is a rich language with different collection kinds (sets, multi-sets, sequences) and a large var...
Mirco Kuhlmann, Martin Gogolla
CORR
2006
Springer
111views Education» more  CORR 2006»
13 years 10 months ago
Raisonner avec des diagrammes : perspectives cognitives et computationnelles
ABSTRACT. Reasoning with diagrams: cognitive and computational perspectives. Diagrammatic, analogical or iconic representations are often contrasted with linguistic or logical repr...
Catherine Recanati
FUIN
2006
103views more  FUIN 2006»
13 years 10 months ago
A Categorical View on Algebraic Lattices in Formal Concept Analysis
Formal concept analysis has grown from a new branch of the mathematical field of lattice theory to a widely recognized tool in Computer Science and elsewhere. In order to fully be...
Pascal Hitzler, Markus Krötzsch, Guo-Qiang Zh...
IANDC
2006
102views more  IANDC 2006»
13 years 10 months ago
Polynomial certificates for propositional classes
This paper studies the complexity of learning classes of expressions in propositional logic from equivalence queries and membership queries. In particular, we focus on bounding th...
Marta Arias, Aaron Feigelson, Roni Khardon, Rocco ...