Sciweavers

630 search results - page 107 / 126
» Symbolic Domain Decomposition
Sort
View
ICLP
2010
Springer
14 years 11 days ago
Tabling and Answer Subsumption for Reasoning on Logic Programs with Annotated Disjunctions
Probabilistic Logic Programming is an active field of research, with many proposals for languages, semantics and reasoning algorithms. One such proposal, Logic Programming with A...
Fabrizio Riguzzi, Terrance Swift
BIRTHDAY
2006
Springer
14 years 6 days ago
Verification by Parallelization of Parametric Code
Abstract. Loops and other unbound control structures constitute a major bottleneck in formal software verification, because correctness proofs over such control structures generall...
Tobias Gedell, Reiner Hähnle
CIKM
2008
Springer
13 years 10 months ago
A system for finding biological entities that satisfy certain conditions from texts
Finding biological entities (such as genes or proteins) that satisfy certain conditions from texts is an important and challenging task in biomedical information retrieval and tex...
Wei Zhou, Clement T. Yu, Weiyi Meng
AAAI
2010
13 years 10 months ago
Relational Partially Observable MDPs
Relational Markov Decision Processes (MDP) are a useraction for stochastic planning problems since one can develop abstract solutions for them that are independent of domain size ...
Chenggang Wang, Roni Khardon
AAAI
2006
13 years 10 months ago
Reasoning about Partially Observed Actions
Partially observed actions are observations of action executions in which we are uncertain about the identity of objects, agents, or locations involved in the actions (e.g., we kn...
Megan Nance, Adam Vogel, Eyal Amir