83 search results - page 8 / 17 » Visualizing Logical Dependencies in SWRL Rule Bases |
ICDE
1996
IEEE
14 years 9 months ago
1996
IEEE
This paper presents a difference calculus for determining changes to rule conditions in an active DBMS. The calculus has been used for implementing an algorithm to efficiently mon...
TMM
2002
13 years 7 months ago
2002
Abstract--Although various Logical Story Unit (LSU) segmentation methods based on visual content have been presented in literature, a common ground for comparison is missing. We pr...
CADE
2010
Springer
13 years 8 months ago
2010
Springer
Abstract. While many higher-order interactive theorem provers include a choice operator, higher-order automated theorem provers currently do not. As a step towards supporting autom...
LPNMR
1999
Springer
13 years 12 months ago
1999
Springer
We introduce choice logic programs as negation-free datalog programs that allow rules to have exclusive-only (possibly empty) disjunctions in the head. Such programs naturally mod...
PLPV
2009
ACM
14 years 4 months ago
2009
ACM
We propose a new way to reason about general recursive functional programs in the dependently typed programming language Agda, which is based on Martin-L¨of’s intuitionistic ty...