1017 search results - page 43 / 204 » Higher-Order Logic Programming Languages with Constraints: A... |
114
click to vote
IFIP
2001
Springer
15 years 2 months ago
2001
Springer
— Semi-formal verification based on symbolic simulation offers a good compromise between formal model checking and numerical simulation. The generation of functional test vector...
POPL
2011
ACM
14 years 15 days ago
2011
ACM
There have been several efforts to bring static type inference to object-oriented dynamic languages such as Ruby, Python, and Perl. In our experience, however, such type inference...
115
click to vote
DEXAW
2003
IEEE
15 years 3 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...
FLOPS
2008
Springer
14 years 11 months ago
2008
Springer
In this paper, we present an extension of the scheme HH(C) (Hereditary Harrop formulas with Constraints) with a suitable formulation of negation in order to obtain a constraint ded...
76
Voted
LICS
2009
IEEE
15 years 4 months ago
2009
IEEE
We describe a substructural logic with ordered, linear, and persistent propositions and then endow a fragment with a committed choice forward-chaining operational interpretation. ...