Sciweavers

10 search results - page 2 / 2
» A Comparison of Merging Operators in Possibilistic Logic
Sort
View
COMMA
2008
13 years 6 months ago
A Level-based Approach to Computing Warranted Arguments in Possibilistic Defeasible Logic Programming
Abstract. Possibilistic Defeasible Logic Programming (P-DeLP) is an argumentation framework based on logic programming which incorporates a treatment of possibilistic uncertainty a...
Teresa Alsinet, Carlos Iván Chesñeva...
ECSQARU
2005
Springer
13 years 10 months ago
Argument-Based Expansion Operators in Possibilistic Defeasible Logic Programming: Characterization and Logical Properties
Possibilistic Defeasible Logic Programming (P-DeLP) is a logic programming language which combines features from argumentation theory and logic programming, incorporating as well t...
Carlos Iván Chesñevar, Guillermo Ric...
FOIKS
2008
Springer
13 years 6 months ago
Merging First-Order Knowledge Using Dilation Operators
The area of knowledge merging is concerned with merging conflicting information while preserving as much as possible. Most proposals in the literature work with knowledge bases exp...
Nikos Gorogiannis, Anthony Hunter
CCIA
2005
Springer
13 years 10 months ago
On Warranted Inference in Possibilistic Defeasible Logic Programming
Abstract. Possibilistic Defeasible Logic Programming (P-DeLP) is a logic programming language which combines features from argumentation theory and logic programming, incorporating...
Carlos Iván Chesñevar, Guillermo Ric...
WOLLIC
2007
Springer
13 years 11 months ago
Symmetries in Natural Language Syntax and Semantics: The Lambek-Grishin Calculus
In this paper, we explore the Lambek-Grishin calculus LG: a symmetric version of categorial grammar based on the generalizations of Lambek calculus studied in Grishin [1]. The voca...
Michael Moortgat