Sciweavers

1032 search results - page 10 / 207
» Extended Computation Tree Logic
Sort
View
RULEML
2010
Springer
14 years 8 months ago
On the Problem of Computing Ambiguity Propagation and Well-Founded Semantics in Defeasible Logic
Abstract. In this paper we present the well founded variants of ambiguity blocking and ambiguity propagating defeasible logics. We also show how to extend SPINdle, a state of the a...
Ho-Pun Lam, Guido Governatori
CADE
2008
Springer
15 years 10 months ago
Automata-Based Axiom Pinpointing
Axiom pinpointing has been introduced in description logics (DL) to help the user understand the reasons why consequences hold by computing minimal subsets of the knowledge base th...
Franz Baader, Rafael Peñaloza
IJCAI
1997
14 years 11 months ago
Compiling Prioritized Circumscription into Extended Logic Programs
We propose a method of compiling circumscription into Extended Logic Programs which is widely applicable to a class of parallel circumscription as well as a class of prioritized c...
Toshiko Wakaki, Ken Satoh
FOSSACS
2004
Springer
15 years 3 months ago
Soft lambda-Calculus: A Language for Polynomial Time Computation
Soft linear logic ([Lafont02]) is a subsystem of linear logic characterizing the class PTIME. We introduce Soft lambda-calculus as a calculus typable in the intuitionistic and affi...
Patrick Baillot, Virgile Mogbil
ICLP
2003
Springer
15 years 2 months ago
On Deterministic Computations in the Extended Andorra Model
Logic programming is based on the idea that computation is controlled inference. The Extended Andorra Model provides a very powerful framework that supports both co-routining and p...
Ricardo Lopes, Vítor Santos Costa, Fernando...