4370 search results - page 660 / 874 » Algebra of Logic Programming |
136
click to vote
CCS
2007
ACM
15 years 10 months ago
2007
ACM
In defining large, complex access control policies, one would like to compose sub-policies, perhaps authored by different organizations, into a single global policy. Existing po...
132
click to vote
TLDI
2005
ACM
15 years 9 months ago
2005
ACM
Two different ways of defining ad-hoc polymorphic operations commonly occur in programming languages. With the first form polymorphic operations are defined inductively on the...
164
click to vote
CCS
2005
ACM
15 years 9 months ago
2005
ACM
The NRL Protocol Analyzer (NPA) is a tool for the formal specification and analysis of cryptographic protocols that has been used with great effect on a number of complex real-l...
140
click to vote
IJCAI
2003
15 years 5 months ago
2003
Refinement operators for theories avoid the problems related to the myopia of many relational learning algorithms based on the operators that refine single clauses. However, the n...
223
click to vote
ICLP
2009
Springer
16 years 4 months ago
2009
Springer
The SLG-WAM of XSB Prolog soundly implements the Well-Founded Semantics (WFS) for logic programs, but in a few pathological cases its engine treats atoms as undefined that are true...