Sciweavers

275 search results - page 20 / 55
» A Family of Defeasible Reasoning Logics and its Implementati...
Sort
View
FM
2001
Springer
142views Formal Methods» more  FM 2001»
13 years 12 months ago
Model-Checking over Multi-valued Logics
Classical logic cannot be used to effectively reason about systems with uncertainty (lack of essential information) or inconsistency (contradictory information often occurring when...
Marsha Chechik, Steve M. Easterbrook, Victor Petro...
CADE
2009
Springer
14 years 8 months ago
Efficient Intuitionistic Theorem Proving with the Polarized Inverse Method
The inverse method is a generic proof search procedure applicable to non-classical logics satisfying cut elimination and the subformula property. In this paper we describe a genera...
Sean McLaughlin, Frank Pfenning
LPAR
2001
Springer
13 years 11 months ago
Inferring Termination Conditions for Logic Programs Using Backwards Analysis
This paper focuses on the inference of modes for which a logic program is guaranteed to terminate. This generalizes traditional termination analysis where an analyzer tries to veri...
Samir Genaim, Michael Codish
LPNMR
2004
Springer
14 years 22 days ago
Reasoning About Actions and Change in Answer Set Programming
Abstract. This paper studies computational issues related to the problem of reasoning about actions and change (RAC) by exploiting its link with the Answer Set Programming paradigm...
Yannis Dimopoulos, Antonis C. Kakas, Loizos Michae...
SEMWEB
2007
Springer
14 years 1 months ago
Extending Fuzzy Description Logics with a Possibilistic Layer
Classical ontologies are not suitable to represent imprecise nor uncertain pieces of information. As a solution we will combine fuzzy Description Logics with a possibilistic layer....
Fernando Bobillo, Miguel Delgado, Juan Góme...