177 search results - page 29 / 36 » Extending Conceptual Logic Programs with Arbitrary Rules |
ICFP
2000
ACM
13 years 11 months ago
2000
ACM
We review the close relationship between abstract machines for (call-by-name or call-by-value) λ-calculi (extended with Felleisen’s C) and sequent calculus, reintroducing on the...
FCA
2005
Springer
14 years 1 months ago
2005
Springer
Abstract. A main goal of Formal Concept Analysis from its very beginning has been the support of rational communication. The source of this goal lies in our understanding of mathem...
ECOOP
1998
Springer
13 years 11 months ago
1998
Springer
Predicate dispatching generalizes previous method dispatch mechanisms by permitting arbitrary predicates to control method applicability and by using logical implication between pr...
CCS
2011
ACM
12 years 7 months ago
2011
ACM
We present the design, implementation and evaluation of an algorithm that checks audit logs for compliance with privacy and security policies. The algorithm, which we name reduce,...
UML
2000
Springer
13 years 11 months ago
2000
Springer
In this paper, dynamic meta modeling is proposed as a new approach to the operational semantics of behavioral UML diagrams. The dynamic meta model extends the well-known static met...