Sciweavers

454 search results - page 26 / 91
» Representation results for defeasible logic
Sort
View
CORR
2011
Springer
126views Education» more  CORR 2011»
13 years 11 days ago
New Polynomial Classes for Logic-Based Abduction
We address the problem of propositional logic-based abduction, i.e., the problem of searching for a best explanation for a given propositional observation according to a given pro...
Bruno Zanuttini
ATVA
2005
Springer
112views Hardware» more  ATVA 2005»
14 years 2 months ago
Reasoning About Transfinite Sequences
We introduce a family of temporal logics to specify the behavior of systems with Zeno behaviors. We extend linear-time temporal logic LTL to authorize models admitting Zeno sequen...
Stéphane Demri, David Nowak
TCS
2011
13 years 3 months ago
Realizability models and implicit complexity
New, simple, proofs of soundness (every representable function lies in a given complexity class) for Elementary Affine Logic, LFPL and Soft Affine Logic are presented. The proofs ...
Ugo Dal Lago, Martin Hofmann
CIRA
2007
IEEE
136views Robotics» more  CIRA 2007»
14 years 3 months ago
Algebraic interval constraint driven exploration in human-agent collaborative problem solving
—To enable effective human-agent collaboration, new human-centric computing paradigms are needed. This paper presents a soft constraint representation scheme based on generalized...
Yan Wang
EUSFLAT
2007
468views Fuzzy Logic» more  EUSFLAT 2007»
13 years 10 months ago
Soft Computing Robot Navigation Case Study
This contribution presents Soft Computing Robot Navigation for mobile robot SCORCAS, a Case Study. The Navigation uses fuzzy logic experienced on mobile robot systems. Fuzzy logic...
Dimitar Vassilev Lakov, Margarita Raykova Saraliev...