Sciweavers

50 search results - page 2 / 10
» A Preference Semantics for Ground Nonmonotonic Modal Logics
Sort
View
KR
2000
Springer
13 years 9 months ago
Finding Admissible and Preferred Arguments Can be Very Hard
Bondarenko et al. have recently proposed an extension of the argumentation-theoretic semantics of admissible and preferred arguments, originally proposed for logic programming onl...
Yannis Dimopoulos, Bernhard Nebel, Francesca Toni
ICLP
2005
Springer
13 years 11 months ago
Hybrid Probabilistic Logic Programs with Non-monotonic Negation
1 In [20], a new Hybrid Probabilistic Logic Programs framework is proposed, and a new semantics is developed to enable encoding and reasoning about real-world applications. In this...
Emad Saad, Enrico Pontelli
TABLEAUX
2000
Springer
13 years 9 months ago
A Labelled Tableau Calculus for Nonmonotonic (Cumulative) Consequence Relations
Abstract. In this paper we present a labelled proof method for computing nonmonotonic consequence relations in a conditional logic setting. The method is based on the usual possibl...
Alberto Artosi, Guido Governatori, Antonino Rotolo
LOGCOM
2002
105views more  LOGCOM 2002»
13 years 5 months ago
Labelled Tableaux for Nonmonotonic Reasoning: Cumulative Consequence Relations
In this paper we present a labelled proof method for computing nonmonotonic consequence relations in a conditional logic setting. The method exploits the strong connection between...
Alberto Artosi, Guido Governatori, Antonino Rotolo
EUROCAST
2007
Springer
133views Hardware» more  EUROCAST 2007»
13 years 9 months ago
Temporal Equilibrium Logic: A First Approach
In this paper we introduce an extension of Equilibrium Logic (a logical characterisation of the Answer Set Semantics for logic programs) consisting in the inclusion of modal tempor...
Pedro Cabalar, Gilberto Pérez Vega