Sciweavers

7961 search results - page 279 / 1593
» Input-Output Model Programs
Sort
View
VSTTE
2005
Springer
15 years 10 months ago
Linking the Meaning of Programs to What the Compiler Can Verify
We formulate some research and development challenges that relate what a verifying compiler can verify to the definition and analysis of the application-content of programs, where...
Egon Börger
MEMOCODE
2003
IEEE
15 years 9 months ago
Executable Computational Logics: Combining Formal Methods and Programming Language Based System Design
An executable computational logic can provide the desired bridge between formal system properties and formal methods to verify them on the one hand, and executable models of syste...
José Meseguer
LPNMR
1999
Springer
15 years 8 months ago
A Comparison of Sceptical NAF-Free Logic Programming Approaches
Recently there has been increased interest in logic programming-based default reasoning approaches which are not using negation-as-failure in their object language. Instead, defau...
Grigoris Antoniou, Michael J. Maher, David Billing...
AAAI
2008
15 years 6 months ago
Loop Formulas for Logic Programs with Arbitrary Constraint Atoms
We formulate loop formulas for logic programs with arbitrary constraint atoms, for the semantics based on conditional satisfaction. This provides a method for answer set computati...
Jia-Huai You, Guohua Liu
NIPS
2007
15 years 5 months ago
Random Sampling of States in Dynamic Programming
We combine three threads of research on approximate dynamic programming: sparse random sampling of states, value function and policy approximation using local models, and using lo...
Christopher G. Atkeson, Benjamin Stephens