For a locally optimal solution to the nonlinear semidefinite programming problem, under Robinson's constraint qualification, the following conditions are proved to be equival...
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...
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. ...
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...
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...