571 search results - page 4 / 115 » Domain Theory in Logical Form |
89
Voted
CCS
2011
ACM
13 years 9 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,...
ICAIL
2003
ACM
15 years 2 months ago
2003
ACM
Defeasible Logic is a promising representation for legal knowledge that appears to overcome many of the deficiencies of previous approaches to representing legal knowledge. Unfor...
CORR
2010
Springer
14 years 9 months ago
2010
Springer
Standard hybrid learners that use domain knowledge require stronger knowledge that is hard and expensive to acquire. However, weaker domain knowledge can benefit from prior knowle...
ENTCS
2002
14 years 9 months ago
2002
By using intersection types and filter models we formulate a theory of types for a -calculus with record subtyping via a finitary programming logic. Types are interpreted as space...
VLSID
2007
IEEE
15 years 10 months ago
2007
IEEE
Boolean Satisfiability is seeing increasing use as a decision procedure in Electronic Design Automation (EDA) and other domains. Most applications encode their domain specific cons...