1017 search results - page 85 / 204 » Higher-Order Logic Programming Languages with Constraints: A... |
117
click to vote
APSEC
2007
IEEE
15 years 4 months ago
2007
IEEE
Executable UML allows precisely describing the softtem at a higher level of abstraction. It bridges the semantics gap between the UML design models and the implementation. The exe...
FUIN
2008
14 years 9 months ago
2008
Many popular ontology languages are based on (subsets of) first-order predicate logic, with classes represented by unary predicates and properties by binary predicates. Specificall...
LICS
1992
IEEE
15 years 1 months ago
1992
IEEE
d Abstract) Frank S. de Boer, Jan Willem Klopyz , Catuscia Palamidessiyx We study the paradigm of asynchronous process communication, as contrasted with the synchronous communicat...
PPDP
2005
Springer
15 years 3 months ago
2005
Springer
fects are statically generated program abstractions, that can be model checked for verification of assertions in a temporal program logic. In this paper we develop a type and eff...
LPNMR
2005
Springer
15 years 3 months ago
2005
Springer
Given two classes of logic programs, we may be interested in modular translations from one class into the other that are sound wth respect to the answer set semantics. The main the...