Sciweavers

186 search results - page 24 / 38
» Completing Inverse Entailment
Sort
View
JELIA
2010
Springer
13 years 6 months ago
Sets of Boolean Connectives That Make Argumentation Easier
Abstract. Many proposals for logic-based formalizations of argumentation consider an argument as a pair (Φ, α), where the support Φ is understood as a minimal consistent subset ...
Nadia Creignou, Johannes Schmidt, Michael Thomas, ...
APWEB
2011
Springer
13 years 2 months ago
A Tableau Algorithm for Paraconsistent and Nonmonotonic Reasoning in Description Logic-Based System
This paper proposes a paraconsistent and nonmonotonic extension of description logic by planting a nonmonotonic mechanism called minimal inconsistency in paradoxical description lo...
Xiaowang Zhang, Zuoquan Lin, Kewen Wang
CORR
2011
Springer
151views Education» more  CORR 2011»
12 years 11 months ago
A New Representation Theorem for Many-valued Modal Logics
We propose a new definition of the representation theorem for many-valued logics, with modal operators as well, and define the stronger relationship between algebraic models of ...
Zoran Majkic
IROS
2009
IEEE
224views Robotics» more  IROS 2009»
14 years 2 months ago
Humanoid motion planning for dual-arm manipulation and re-grasping tasks
— In this paper, we present efficient solutions for planning motions of dual-arm manipulation and re-grasping tasks. Motion planning for such tasks on humanoid robots with a hig...
Niko Vahrenkamp, Dmitry Berenson, Tamim Asfour, Ja...
TABLEAUX
2000
Springer
13 years 11 months ago
Benchmark Analysis with FaCT
FaCT (Fast Classification of Terminologies) is a Description Logic (DL) classifier that can also be used for modal logic satisfiability testing. The FaCT system includes two reason...
Ian Horrocks