855 search results - page 7 / 171 » Using First-Order Logic to Reason about Policies |
84
Voted
CADE
2006
Springer
15 years 9 months ago
2006
Springer
Access-control policies have grown from simple matrices to non-trivial specifications written in sophisticated languages. The increasing complexity of these policies demands corres...
69
Voted
CADE
2007
Springer
15 years 9 months ago
2007
Springer
We present a method for proving rigid first order theorems by encoding them as propositional satisfiability problems. We encode the existence of a first order connection tableau an...
87
Voted
KR
2000
Springer
15 years 1 months ago
2000
Springer
Recent experimental results have shown that the strength of resolution, the propositional DPLL procedure, the KSAT procedure for description logics, or related tableau-like implem...
101
click to vote
FLAIRS
2008
14 years 12 months ago
2008
One of the major weaknesses of current research on the Semantic Web (SW) is the lack of proper means to represent and reason with uncertainty. A number of recent efforts from the ...
ILP
2004
Springer
15 years 2 months ago
2004
Springer
Many domains in the field of Inductive Logic Programming (ILP) involve highly unbalanced data. Our research has focused on Information Extraction (IE), a task that typically invol...