643 search results - page 49 / 129 » Semantic Determinism and Functional Logic Program Properties |
169
click to vote
DEXAW
2003
IEEE
15 years 9 months ago
2003
IEEE
We integrate ontology languages and logic programming (LP) by extending disjunctive logic programs (DLPs) and their semantics in order to support inverses and an infinite univers...
136
click to vote
POPL
2010
ACM
16 years 1 months ago
2010
ACM
We present an analysis to automatically determine if a program represents a continuous function, or equivalently, if infinitesimal changes to its inputs can only cause infinitesim...
146
click to vote
LICS
1994
IEEE
15 years 8 months ago
1994
IEEE
The theory of cut-free sequent proofs has been used to motivate and justify the design of a number of logic programming languages. Two such languages, Prolog and its linear logic ...
155
click to vote
TAP
2010
Springer
15 years 1 months ago
2010
Springer
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...
123
click to vote
CSL
2003
Springer
15 years 9 months ago
2003
Springer
The semantics of class-based languages can be defined in terms of objects only [8, 7, 1] if classes are viewed as objects with a constructor method. One obtains a store in which m...