90 search results - page 8 / 18 » Discovering Classes of Strongly Equivalent Logic Programs |
ICLP
2010
Springer
14 years 14 days ago
2010
Springer
Abstract. In this doctoral work we aim at developing a new approach to labelled semantics and equivalences for the Concurrent Constraint Programming (CCP) which will enable a broad...
ICDE
1993
IEEE
14 years 21 days ago
1993
IEEE
The IsaLog model and language are presented. The model has complex objects with classes, relations, and isa hierarchies. The language is strongly typed and declarative. The main i...
JAPLL
2010
13 years 7 months ago
2010
Semantic web applications based on the web ontology language (OWL) often require the use of numbers in class descriptions for expressing cardinality restrictions on properties or ...
PEPM
2007
ACM
14 years 2 months ago
2007
ACM
A logic program strongly quasi-terminates when only a finite number of distinct atoms (modulo variable renaming) are derivable from any given query and computation rule. This noti...
ESOP
2006
Springer
14 years 7 days ago
2006
Springer
We present a sound and complete proof technique, based on syntactic logical relations, for showing contextual equivalence of expressions in a -calculus with recursive types and imp...