4513 search results - page 398 / 903 » Logic programming with satisfiability |
134
Voted
ICFP
2000
ACM
15 years 9 months ago
2000
ACM
We show that standard formulations of intersection type systems are unsound in the presence of computational effects, and propose a solution similar to the value restriction for ...
156
click to vote
POPL
2010
ACM
15 years 5 months ago
2010
ACM
In this paper, we explore the potential of the theory of nested words for partial correctness proofs of recursive programs. Our conceptual contribution is a simple framework that ...
131
Voted
IISWC
2009
IEEE
15 years 11 months ago
2009
IEEE
—Communication traces are integral to performance modeling and analysis of parallel programs. However, execution on a large number of nodes results in a large trace volume that i...
276
Voted
AI
2011
Springer
15 years 3 days ago
2011
Springer
An important question for the upcoming Semantic Web is how to best combine open world ontology languages, such as the OWL-based ones, with closed world rule-based languages. One o...
133
click to vote
BIRTHDAY
2005
Springer
15 years 10 months ago
2005
Springer
I present a formalism that combines two methodologies: objective Bayesianism and Bayesian nets. According to objective Bayesianism, an agent’s degrees of belief (i) ought to sat...