Sciweavers

379 search results - page 61 / 76
» Probabilistic (logic) programming concepts
Sort
View
POPL
2005
ACM
14 years 10 months ago
Precise interprocedural analysis using random interpretation
We describe a unified framework for random interpretation that generalizes previous randomized intraprocedural analyses, and also extends naturally to efficient interprocedural an...
Sumit Gulwani, George C. Necula
AOSD
2007
ACM
14 years 1 months ago
Orthogonal persistence and AOP: a balancing act
In order to increase the productivity of the application developers, it is desirable to remove the persistence concern from their responsibility. For this purpose, the orthogonal ...
Mohammed Al-Mansari, Stefan Hanenberg, Rainer Unla...
ECAI
2004
Springer
14 years 3 months ago
Combining Multiple Answers for Learning Mathematical Structures from Visual Observation
Learning general truths from the observation of simple domains and, further, learning how to use this knowledge are essential capabilities for any intelligent agent to understand ...
Paulo Santos, Derek R. Magee, Anthony G. Cohn, Dav...
CEC
2011
IEEE
12 years 9 months ago
Cost-benefit analysis of using heuristics in ACGP
—Constrained Genetic Programming (CGP) is a method of searching the Genetic Programming search space non-uniformly, giving preferences to certain subspaces according to some heur...
John W. Aleshunas, Cezary Z. Janikow
CADE
1998
Springer
14 years 2 months ago
System Description: card TAP: The First Theorem Prover on a Smart Card
Abstract. We present the first implementation of a theorem prover running on a smart card. The prover is written in Java and implements a dual tableau calculus. Due to the limited ...
Rajeev Goré, Joachim Posegga, Andrew Slater...