Sciweavers

509 search results - page 57 / 102
» On the completeness of compositional reasoning methods
Sort
View
DEON
2004
Springer
14 years 18 days ago
Conflicting Imperatives and Dyadic Deontic Logic
Often a set of imperatives or norms seems satisfiable from the outset, but conflicts arise when ways to fulfill all are ruled out by unfortunate circumstances. Semantic methods to ...
Jörg Hansen
ILP
2000
Springer
14 years 13 days ago
Searching the Subsumption Lattice by a Genetic Algorithm
A framework for combining Genetic Algorithms with ILP methods is introduced and a novel binary representation and relevant genetic operators are discussed. It is shown that the pro...
Alireza Tamaddoni-Nezhad, Stephen Muggleton
AAAI
2007
13 years 11 months ago
Partial Matchmaking using Approximate Subsumption
Description Logics, and in particular the web ontology language OWL has been proposed as an appropriate basis for computing matches between structured objects for the sake of info...
Heiner Stuckenschmidt
DLOG
2008
13 years 11 months ago
Consistency Checking for Extended Description Logics
In this paper we consider the extensions of description logics that were proposed to represent uncertain or vague knowledge, focusing on the fuzzy and possibilistic formalisms. We ...
Olivier Couchariere, Marie-Jeanne Lesot, Bernadett...
AICOM
2010
92views more  AICOM 2010»
13 years 9 months ago
SOLAR: An automated deduction system for consequence finding
SOLAR (SOL for Advanced Reasoning) is a first-order clausal consequence finding system based on the SOL (Skip Ordered Linear) tableau calculus. The ability to find non-trivial cons...
Hidetomo Nabeshima, Koji Iwanuma, Katsumi Inoue, O...