Sciweavers

727 search results - page 22 / 146
» A Method for Implementing Equational Theories as Logic Progr...
Sort
View
POPL
2010
ACM
14 years 5 months ago
A Theory of Indirection via Approximation
Building semantic models that account for various kinds of indirect reference has traditionally been a difficult problem. Indirect reference can appear in many guises, such as hea...
Aquinas Hobor, Robert Dockins, Andrew W. Appel
LICS
2002
IEEE
14 years 14 days ago
Computational Adequacy for Recursive Types in Models of Intuitionistic Set Theory
This paper provides a unifying axiomatic account of the interpretation of recursive types that incorporates both domain-theoretic and realizability models as concrete instances. O...
Alex K. Simpson
ATAL
1999
Springer
13 years 12 months ago
Reactivity in a Logic-Based Robot Programming Framework
A robot must often react to events in its environment and exceptional conditions by suspendingor abandoning its current plan and selecting a new plan that is an appropriate respons...
Yves Lespérance, Kenneth Tam, Michael R. M....
JUCS
2010
134views more  JUCS 2010»
13 years 6 months ago
Newton Method for Nonlinear Dynamic Systems with Adaptive Time Stepping
Abstract: This paper presents a nonlinear solver based on the Newton-Krylov methods, where the Newton equations are solved by Krylov-subspace type approaches. We focus on the solut...
Wensheng Shen, Changjiang Zhang, Jun Zhang, Xiaoqi...
ICLP
2007
Springer
14 years 1 months ago
Automatic Correctness Proofs for Logic Program Transformations
Abstract. The many approaches which have been proposed in the literature for proving the correctness of unfold/fold program transformations, consist in associating suitable well-fo...
Alberto Pettorossi, Maurizio Proietti, Valerio Sen...