Sciweavers

1916 search results - page 147 / 384
» Reasoning with class algebra
Sort
View
93
Voted
CADE
2006
Springer
16 years 1 months ago
A Recursion Combinator for Nominal Datatypes Implemented in Isabelle/HOL
The nominal datatype package implements an infrastructure in Isabelle/HOL for defining languages involving binders and for reasoning conveniently about alpha-equivalence classes. P...
Christian Urban, Stefan Berghofer
92
Voted
CL
2000
Springer
15 years 5 months ago
Representing Trees with Constraints
This paper presents a method for representing trees using constraint logic programming over finite domains. We describe a class of trees that is of particular interest to us and h...
Ben Curry, Geraint A. Wiggins, Gillian Hayes
112
Voted
AIM
2005
15 years 22 days ago
Description Logics and Planning
This paper surveys previous work on combining planning techniques with expressive representations of knowledge in description logics to reason about tasks, plans, and goals. Descr...
Yolanda Gil
123
Voted
LICS
2010
IEEE
14 years 11 months ago
On Strong Maximality of Paraconsistent Finite-Valued Logics
Abstract—Maximality is a desirable property of paraconsistent logics, motivated by the aspiration to tolerate inconsistencies, but at the same time retain as much as possible fro...
Arnon Avron, Ofer Arieli, Anna Zamansky
116
Voted
DLOG
2011
14 years 4 months ago
Extracting Finite Sets of Entailments from OWL Ontologies
The canonical standard description logic reasoning service is classification, that is, the generation of the set of atomic subsumptions which are entailed by some ontology. While ...
Samantha Bail, Bijan Parsia, Ulrike Sattler