Send your message by email

Advanced search

**Abstract**

Among the several possible forms of rational reasoning, logical reasoning and probabilistic inference have received particular attention in practive, having been incorporated both in modeling situations of the world and in computer programs aimed at performing a variety of tasks. However, the possible interactions between these forms of reasoning are not very well understood yet, both in theory and in the practice of constructing computational applications. In the theoretical perspective, it is still to be established the relationship between truth values and probability distributions over formulas. In the practical perspective, it is still to be established the limits of when to apply logical reasoning and when to apply statistic inference. This research project intends to investigate those questions, both in the theoretical and practical perspectives. The project will focus on four interface areas between logic and probabilities, namely, probabilistic satisfiability, probabilistic description logics applied to the semantic web, probabilistic planning and scene analysis. This project intends to produce several pieces of software covering the area under investigation that will be made available under a FLOSS (Free/Libre/Open Source Software) license as part of the activities of the Artificial Intelligence division of the Center for Competence in Free Software at the University of Sao Paulo. (AU)

Articles published in Agência FAPESP Newsletter about the research grant |

The quest for intelligent computers |

Scientific publications
(10)

(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)

COZMAN, FABIO G.
Independence for full conditional probabilities: Structure, factorization, non-uniqueness, and Bayesian networks.
** INTERNATIONAL JOURNAL OF APPROXIMATE REASONING**,
v. 54,
n. 9,
p. 1261-1278,
NOV 2013.
Web of Science Citations: 5.

D'AGOSTINO, MARCELLO;
FINGER, MARCELO;
GABBAY, DOV.
Semantics and proof-theory of depth bounded Boolean logics.
** THEORETICAL COMPUTER SCIENCE**,
v. 480,
p. 43-68,
APR 8 2013.
Web of Science Citations: 7.

BUENO-SOLER, JULIANA.
Models for anodic and cathodic multimodalities.
** LOGIC JOURNAL OF THE IGPL**,
v. 20,
n. 2, SI,
p. 458-476,
APR 2012.
Web of Science Citations: 2.

FINGER, MARCELO.
Towards automated first-order abduction: the cut-based approach.
** LOGIC JOURNAL OF THE IGPL**,
v. 20,
n. 2, SI,
p. 370-387,
APR 2012.
Web of Science Citations: 0.

COZMAN, FABIO G.
Sets of probability distributions, independence, and convexity.
** SYNTHESE**,
v. 186,
n. 2,
p. 577-600,
2012.
Web of Science Citations: 22.

DELGADO, KARINA VALDIVIA;
DE BARROS, LELIANE NUNES;
COZMAN, FABIO GAGLIARDI;
SANNER, SCOTT.
Using mathematical programming to solve Factored Markov Decision Processes with Imprecise Probabilities.
** INTERNATIONAL JOURNAL OF APPROXIMATE REASONING**,
v. 52,
n. 7,
p. 1000-1017,
OCT 2011.
Web of Science Citations: 4.

DELGADO, KARINA VALDIVIA;
SANNER, SCOTT;
DE BARROS, LELIANE NUNES.
Efficient solutions to factored MDPs with imprecise transition probabilities.
** ARTIFICIAL INTELLIGENCE**,
v. 175,
n. 9-10,
p. 1498-1527,
JUN 2011.
Web of Science Citations: 17.

KIKUTI, DANIEL;
COZMAN, FABIO GAGLIARDI;
SHIROTA FILHO, RICARDO.
Sequential decision making with partially ordered preferences.
** ARTIFICIAL INTELLIGENCE**,
v. 175,
n. 7-8, SI,
p. 1346-1365,
MAY 2011.
Web of Science Citations: 13.

DEE‚ H.M.;
SANTOS‚ P.E.
The perception and content of cast shadows: an interdisciplinary review.
** Spatial Cognition and Computation**,
v. 11,
n. 3,
p. 226-253,
2011.

FINGER, MARCELO;
BEZERRA, GERMANO C.;
CONDE, DANILO R.
Resource use pattern analysis for predicting resource availability in opportunistic grids.
** CONCURRENCY AND COMPUTATION-PRACTICE & EXPERIENCE**,
v. 22,
n. 3, SI,
p. 295-313,
MAR 10 2010.
Web of Science Citations: 11.

Please report errors in scientific publications list by writing to:
cdi@fapesp.br.