Advanced search
Start date

Deductive-probabilistic reasoning: algorithms and applications

Grant number: 11/19860-4
Support Opportunities:Scholarships abroad - Research
Effective date (Start): August 01, 2012
Effective date (End): July 31, 2013
Field of knowledge:Physical Sciences and Mathematics - Computer Science
Principal Investigator:Marcelo Finger
Grantee:Marcelo Finger
Host Investigator: Bart Selman
Host Institution: Instituto de Matemática e Estatística (IME). Universidade de São Paulo (USP). São Paulo , SP, Brazil
Research place: Cornell University, United States  
Associated research grant:08/03995-5 - Logprob: probabilistic logic --- foundations and computational applications, AP.TEM


Deductive reasoning and probabilistic reasoning have experienced an enormous development within the Artificial Intelligence community in the past decades. While deductive reasoning has been part of AI since its birth, the computational complexity of its problems ranges between the intractable and the undecidable. The realization that not all instances of intractable problems are hard prompted the development of efficient SAT solvers and applications and the size of problems dealt by this approach significantly started to increase, and now can solve instances with hundreds of thousands of variables. Probabilities have also been part of AI since its beginnings, but probabilistic reasoning in AI has had its greatest development starting with the consolidation of its computational properties, which lead to further developments in reasoning about causalities and the large employment of graph-based probabilistic models in a wide range of applications. The competition and cross-fertilization between those two approaches have promoted and accelerated the development of the field of AI itself. In this project, we are interested in a combined form of deductive-probabilistic reasoning. We are interested in a particular form of interaction between these two forms of reasoning called probabilistic logic, and the associated problem of probabilistic satisfiability (PSAT) and logic-probabilistic inference and its potential to practical AI applications. (AU)

News published in Agência FAPESP Newsletter about the scholarship:
Articles published in other media outlets (0 total):
More itemsLess items

Scientific publications
(References retrieved automatically from Web of Science and SciELO through information on FAPESP grants and their corresponding numbers as mentioned in the publications by the authors)
ARRUDA, ALEXANDRE MATOS; FINGER, MARCELO. Completeness for cut-based abduction. LOGIC JOURNAL OF THE IGPL, v. 22, n. 2, SI, p. 286-296, . (11/19860-4)
D'AGOSTINO, MARCELLO; FINGER, MARCELO; GABBAY, DOV. Semantics and proof-theory of depth bounded Boolean logics. THEORETICAL COMPUTER SCIENCE, v. 480, p. 43-68, . (08/03995-5, 10/51038-0, 11/19860-4)

Please report errors in scientific publications list by writing to: