Sciweavers

1342 search results - page 12 / 269
» Ordered Programs as Abductive Systems
Sort
View
MOR
2006
80views more  MOR 2006»
13 years 6 months ago
The Strong Second-Order Sufficient Condition and Constraint Nondegeneracy in Nonlinear Semidefinite Programming and Their Implic
For a locally optimal solution to the nonlinear semidefinite programming problem, under Robinson's constraint qualification, the following conditions are proved to be equival...
Defeng Sun
BIRTHDAY
2005
Springer
14 years 8 days ago
Planning in Answer Set Programming using Ordered Task Decomposition
abstract. In this paper we investigate a formalism for solving planning problems based on ordered task decomposition using Answer Set Programming (ASP). Our planning methodology is...
Jürgen Dix, Ugur Kuter, Dana S. Nau
KI
1990
Springer
13 years 10 months ago
The Representation of Program Synthesis in Higher Order Logic
ue to a lack of abstraction in the formalization of deductive mechanisms involved in programming reasoning tools for the development of program synthesizers are not yet available. ...
Christoph Kreitz
TAP
2010
Springer
134views Hardware» more  TAP 2010»
13 years 4 months ago
Testing First-Order Logic Axioms in Program Verification
Program verification systems based on automated theorem provers rely on user-provided axioms in order to verify domain-specific properties of code. However, formulating axioms corr...
Ki Yung Ahn, Ewen Denney
ESOP
2008
Springer
13 years 8 months ago
Practical Programming with Higher-Order Encodings and Dependent Types
Abstract. Higher-order abstract syntax (HOAS) refers to the technique of representing variables of an object-language using variables of a meta-language. The standard first-order a...
Adam Poswolsky, Carsten Schürmann