Sciweavers

3658 search results - page 461 / 732
» The logic of proofs, semantically
Sort
View
APAL
2010
123views more  APAL 2010»
15 years 6 months ago
Cut elimination and strong separation for substructural logics: An algebraic approach
Abstract. We develop a general algebraic and proof-theoretic study of substructural logics that may lack associativity, along with other structural rules. Our study extends existin...
Nikolaos Galatos, Hiroakira Ono
CORR
2006
Springer
135views Education» more  CORR 2006»
15 years 6 months ago
Constraint Functional Logic Programming over Finite Domains
In this paper, we present our proposal to Constraint Functional Logic Programming over Finite Domains (CFLP(FD) ) with a lazy functional logic programming language which seamlessl...
Antonio J. Fernández, Maria Teresa Hortal&a...
DLOG
2010
15 years 4 months ago
The Logical Difference For Fuzzy EL+ Ontologies
Abstract. Ontologies undergo changes for reasons such as changes in knowledge, meeting varying application requirements. Thus, for different versions of a considered ontology, it i...
Shasha Feng, Yonggang Zhang, Dantong Ouyang, Haiya...
ML
2010
ACM
175views Machine Learning» more  ML 2010»
15 years 1 months ago
Concept learning in description logics using refinement operators
With the advent of the Semantic Web, description logics have become one of the most prominent paradigms for knowledge representation and reasoning. Progress in research and applica...
Jens Lehmann, Pascal Hitzler
ICLP
2009
Springer
16 years 7 months ago
Computing Loops with at Most One External Support Rule for Disjunctive Logic Programs
We extend to disjunctive logic programs our previous work on computing loop formulas of loops with at most one external support. We show that for these logic programs, loop formula...
Xiaoping Chen, Jianmin Ji, Fangzhen Lin