2013 IEEE 25th International Conference on Tools With Artificial Intelligence 2013
DOI: 10.1109/ictai.2013.94
|View full text |Cite
|
Sign up to set email alerts
|

Implementing Tabled Hypothetical Datalog

Help me understand this report

Search citation statements

Order By: Relevance

Paper Sections

Select...
2
2
1

Citation Types

0
34
0

Year Published

2015
2015
2020
2020

Publication Types

Select...
2
2
1

Relationship

0
5

Authors

Journals

citations
Cited by 5 publications
(34 citation statements)
references
References 28 publications
0
34
0
Order By: Relevance
“…Semantics is built with a stratified inference system which can be consulted in [17]. Here we recall the inference rule for the embedded implication: 2 For any goal φ and database instance ∆:…”
Section: Hypothetical Datalogmentioning
confidence: 99%
See 2 more Smart Citations
“…Semantics is built with a stratified inference system which can be consulted in [17]. Here we recall the inference rule for the embedded implication: 2 For any goal φ and database instance ∆:…”
Section: Hypothetical Datalogmentioning
confidence: 99%
“…This means that for proving the conclusion φ, rules R i , together with the current database instance ∆ can be used in subsequent inference steps. The unified stratified semantics defined in [17] builds a set of axioms E that provides a means to assign a meaning to a goal as:…”
Section: Hypothetical Datalogmentioning
confidence: 99%
See 1 more Smart Citation
“…The answer includes those nodes in the graph that are in a cycle. Another option is to avoid cycles by using the following strong constraint (which are defined in [17]):…”
Section: A University Examplementioning
confidence: 99%
“…In this paper, we extend [17] by allowing deletions of tuples, not only for facts as data providers as in [4], but also for rules. Then, rules can be used to intensionally specify those facts that must be deleted in a given context.…”
Section: Introductionmentioning
confidence: 99%