|
Search the dblp DataBase
Gerardo I. Simari:
[Publications]
[Author Rank by year]
[Co-authors]
[Prefers]
[Cites]
[Cited by]
Publications of Author
- Gerardo I. Simari, Simon Parsons
On the relationship between MDPs and the BDI architecture. [Citation Graph (0, 0)][DBLP] AAMAS, 2006, pp:1041-1048 [Conf]
- Gerardo I. Simari, Amy Sliva, Dana S. Nau, V. S. Subrahmanian
A stochastic language for modelling opponent agents. [Citation Graph (0, 0)][DBLP] AAMAS, 2006, pp:244-246 [Conf]
- Maria Vanina Martinez, Andrea Pugliese, Gerardo I. Simari, V. S. Subrahmanian, Henri Prade
How Dirty Is Your Relational Database? An Axiomatic Approach. [Citation Graph (0, 0)][DBLP] ECSQARU, 2007, pp:103-114 [Conf]
- Samir Khuller, Maria Vanina Martinez, Dana S. Nau, Gerardo I. Simari, Amy Sliva, V. S. Subrahmanian
Finding Most Probable Worlds of Probabilistic Logic Programs. [Citation Graph (0, 0)][DBLP] SUM, 2007, pp:45-59 [Conf]
A graph-theoretic approach to protect static and moving targets from adversaries. [Citation Graph (, )][DBLP]
Aggregate Query Answering under Uncertain Schema Mappings. [Citation Graph (, )][DBLP]
Stochastic Reasoning with Models of Agent Behavior. [Citation Graph (, )][DBLP]
Using Histograms to Better Answer Queries to Probabilistic Logic Programs. [Citation Graph (, )][DBLP]
Abductive Inference in Probabilistic Logic Programs. [Citation Graph (, )][DBLP]
Promises Kept, Promises Broken: An Axiomatic and Quantitative Treatment of Fulfillment. [Citation Graph (, )][DBLP]
Inconsistency Management Policies. [Citation Graph (, )][DBLP]
Scaling Most Probable World Computations in Probabilistic Logic Programs. [Citation Graph (, )][DBLP]
Efficient Policy-Based Inconsistency Management in Relational Knowledge Bases. [Citation Graph (, )][DBLP]
Cost-Based Query Answering in Action Probabilistic Logic Programs. [Citation Graph (, )][DBLP]
Computing most probable worlds of action probabilistic logic programs: scalable estimation for 1030, 000 worlds. [Citation Graph (, )][DBLP]
Search in 0.001secs, Finished in 0.002secs
|