Sciweavers

764 search results - page 81 / 153
» On the Expressibility of Stable Logic Programming
Sort
View
HYBRID
2010
Springer
15 years 6 months ago
On the connections between PCTL and dynamic programming
Probabilistic Computation Tree Logic (PCTL) is a wellknown modal logic which has become a standard for expressing temporal properties of finite-state Markov chains in the context...
Federico Ramponi, Debasish Chatterjee, Sean Summer...
SAS
1992
Springer
171views Formal Methods» more  SAS 1992»
15 years 3 months ago
Static Analysis of CLP Programs over Numeric Domains
Abstract Constraint logic programming (CLP) is a generalization of the pure logic programming paradigm, having similar model-theoretic, fixpoint and operational semantics [9]. Sinc...
Roberto Bagnara, Roberto Giacobazzi, Giorgio Levi
ENTCS
2007
124views more  ENTCS 2007»
14 years 11 months ago
Structuring Optimizing Transformations and Proving Them Sound
A compiler optimization is sound if the optimized program that it produces is semantically equivalent to the input program. The proofs of semantic equivalence are usually tedious....
Aditya Kanade, Amitabha Sanyal, Uday P. Khedker
GECCO
2008
Springer
120views Optimization» more  GECCO 2008»
15 years 28 days ago
Genetic programming with polymorphic types and higher-order functions
This article introduces our new approach to program representation for genetic programming (GP). We replace the usual s-expression representation scheme by a strongly-typed ion-ba...
Franck Binard, Amy P. Felty
ECAI
2004
Springer
15 years 5 months ago
An Argumentative Approach to Assessing Natural Language Usage based on the Web Corpus
Abstract. In spite of the significant evolution of spelling and grammar checkers for word-processing software, the problem of judging the appropriateness of language usage in diff...
Carlos Iván Chesñevar, Ana Gabriela ...