Sciweavers

1223 search results - page 220 / 245
» A Logic for Reasoning about Evidence
Sort
View
129
Voted
NGC
1998
Springer
115views Communications» more  NGC 1998»
15 years 1 months ago
On Semantic Resolution with Lemmaizing and Contraction and a Formal Treatment of Caching
Reducing redundancy in search has been a major concern for automated deduction. Subgoal-reduction strategies, such as those based on model elimination and implemented in Prolog te...
Maria Paola Bonacina, Jieh Hsiang
98
Voted
SAC
2008
ACM
15 years 1 months ago
Flexible pointer analysis using assign-fetch graphs
se a new abstraction for pointer analysis that represents reads and writes to memory instead of traditional points-to relations. Compared to points-to graphs, our Assign-Fetch Gra...
Marcio Buss, Daniel Brand, Vugranam C. Sreedhar, S...
IPL
2010
94views more  IPL 2010»
15 years 11 days ago
Partial model checking via abstract interpretation
model checking via abstract interpretation N. De Francesco, G. Lettieri∗ , L. Martini, G. Vaglini Universit`a di Pisa, Dipartimento di Ingegneria dell’Informazione, sez. Inform...
Nicoletta De Francesco, Giuseppe Lettieri, Luca Ma...
167
Voted
VL
2010
IEEE
216views Visual Languages» more  VL 2010»
15 years 8 days ago
Explanatory Debugging: Supporting End-User Debugging of Machine-Learned Programs
Many machine-learning algorithms learn rules of behavior from individual end users, such as taskoriented desktop organizers and handwriting recognizers. These rules form a “prog...
Todd Kulesza, Simone Stumpf, Margaret M. Burnett, ...
IGPL
2010
117views more  IGPL 2010»
14 years 11 months ago
Executable specification of open multi-agent systems
Multi-agent systems where the agents are developed by parties with competing interests, and where there is no access to an agent's internal state, are often classified as `ope...
Alexander Artikis, Marek J. Sergot