#### Filter Results:

- Full text PDF available (39)

#### Publication Year

1998

2017

- This year (2)
- Last 5 years (13)
- Last 10 years (23)

#### Publication Type

#### Co-author

#### Journals and Conferences

#### Key Phrases

Learn More

- Teresa Alsinet, Carlos Iván Chesñevar, Lluis Godo, Guillermo Ricardo Simari
- Fuzzy Sets and Systems
- 2008

In the last decade defeasible argumentation frameworks have evolved to become a sound setting to formalize commonsense, qualitative reasoning. The logic programming paradigm has shown to be particularly useful for developing different argument-based frameworks on the basis of different variants of logic programming which incorporate defeasible rules. Most… (More)

- Teresa Alsinet, Lluis Godo, Sandra A. Sandri
- Electr. Notes Theor. Comput. Sci.
- 2002

- Teresa Alsinet, Felip Manyà, Jordi Planes
- SAT
- 2005

We present two new branch and bound weighted Max-SAT solvers (Lazy and Lazy) which incorporate original data structures and inference rules, and a lower bound of better quality.

Defeasible argumentation frameworks have evolved to become a sound setting to formalize commonsense, qualitative reasoning from incomplete and potentially inconsistent knowledge. Defeasible Logic Programming (DeLP) is a defeasible argumentation formalism based on an extension of logic programming. Although DeLP has been successfully integrated in a number… (More)

- Teresa Alsinet, Lluis Godo
- UAI
- 2000

In this paper we present a propositional logic programming language for reasoning under possibilistic uncertainty and represent ing vague knowledge. Formulas are repre sented by pairs (ip, a), where ip is a many valued proposition and a E [0, 1] is a lower bound on the belief on ip in terms of necessity measures. Belief states are modeled by pos… (More)

- Teresa Alsinet, Lluis Godo
- Int. J. Intell. Syst.
- 2002

- Teresa Alsinet, Felip Manyà, Jordi Planes
- J. Global Optimization
- 2008

We present a new branch and bound algorithm for weighted Max-SAT, called 1 Lazy which incorporates original data structures and inference rules, as well as a lower 2 bound of better quality. We provide experimental evidence that our solver is very competi3 tive and outperforms some of the best performing Max-SAT and weighted Max-SAT solvers 4 on a wide… (More)

- Teresa Alsinet, Carlos Iván Chesñevar, Lluis Godo, Sandra A. Sandri, Guillermo Ricardo Simari
- Int. J. Approx. Reasoning
- 2008

Possibilistic Defeasible Logic Programming (P-DeLP) is a logic programming language which combines features from argumentation theory and logic programming, incorporating the treatment of possibilistic uncertainty at the object-language level. In spite of its expressive power, an important limitation in P-DeLP is that imprecise, fuzzy information cannot be… (More)

- Teresa Alsinet, Lluis Godo, Sandra A. Sandri
- UAI
- 1999

inconsistent Recently a syntactical extension of rst order Possibilistic logic called PLFC dealing with fuzzy constants and fuzzily re stricted quanti ers has been proposed In this paper we present steps towards both the formalization of PLFC itself and an auto mated deduction system for it by i provid ing a formal semantics ii de ning a sound resolution… (More)

- Teresa Alsinet, Lluis Godo
- Fuzzy Sets and Systems
- 2004

PLFC is a 0rst-order possibilistic logic dealing with fuzzy constants and fuzzily restricted quanti0ers. The refutation proof method in PLFC is mainly based on a generalized resolution rule which allows an implicit graded uni0cation among fuzzy constants. However, uni0cation for precise object constants is classical. In order to use PLFC for… (More)