Intelligent query answering in rule based systems
Journal of Logic Programming
A Prolog technology theorem prover: implementation by an extended Prolog computer
Journal of Automated Reasoning
Foundations of disjunctive logic programming
Foundations of disjunctive logic programming
A strategy for the computation of conditional answers
ECAI '92 Proceedings of the 10th European conference on Artificial intelligence
Linear resolution for consequence finding
Artificial Intelligence
Computing answers with model elimination
Artificial Intelligence
A new method for consequence finding and compilation in restricted languages
AAAI '99/IAAI '99 Proceedings of the sixteenth national conference on Artificial intelligence and the eleventh Innovative applications of artificial intelligence conference innovative applications of artificial intelligence
Foundations of Inductive Logic Programming
Foundations of Inductive Logic Programming
Extending abduction from propositional to first-order logic
FAIR '91 Proceedings of the International Workshop on Fundamentals of Artificial Intelligence Research
OLD Resolution with Tabulation
Proceedings of the Third International Conference on Logic Programming
Induction, Abduction, and Consequence-Finding
ILP '01 Proceedings of the 11th International Conference on Inductive Logic Programming
Lemma Matching for a PTTP-based Top-down Theorem Prover
CADE-14 Proceedings of the 14th International Conference on Automated Deduction
Automated theorem proving: A logical basis (Fundamental studies in computer science)
Automated theorem proving: A logical basis (Fundamental studies in computer science)
Application of theorem proving to problem solving
IJCAI'69 Proceedings of the 1st international joint conference on Artificial intelligence
An inference rule for hypothesis generation
IJCAI'91 Proceedings of the 12th international joint conference on Artificial intelligence - Volume 1
Query answering in circumscription
IJCAI'91 Proceedings of the 12th international joint conference on Artificial intelligence - Volume 1
Speculative Computation Through Consequence-Finding in Multi-Agent Environments
Annals of Mathematics and Artificial Intelligence
First order LUB approximations: characterization and algorithms
Artificial Intelligence - Special volume on reformulation
Consequence finding and computing answers with defaults
Journal of Intelligent Information Systems
On Partial Deduction and Conversational Agents
Proceedings of the 2008 conference on Artificial Intelligence Research and Development: Proceedings of the 11th International Conference of the Catalan Association for Artificial Intelligence
Learning partially observable deterministic action models
Journal of Artificial Intelligence Research
First order LUB approximations: characterization and algorithms
Artificial Intelligence - Special volume on reformulation
SOLAR: An automated deduction system for consequence finding
AI Communications - Practical Aspects of Automated Reasoning
A consequence finding approach for full clausal abduction
DS'07 Proceedings of the 10th international conference on Discovery science
Mode-directed inverse entailment for full clausal theories
ILP'07 Proceedings of the 17th international conference on Inductive logic programming
Discovering rules by meta-level abduction
ILP'09 Proceedings of the 19th international conference on Inductive logic programming
Hypothesizing about causal networks with positive and negative effects by meta-level abduction
ILP'10 Proceedings of the 20th international conference on Inductive logic programming
Generalizing conjunctive queries for informative answers
FQAS'11 Proceedings of the 9th international conference on Flexible Query Answering Systems
Completing causal networks by meta-level abduction
Machine Learning
| Hi-index | 0.00 |
In this paper, we study minimal and/or conditional answer computing and its related problems. At first, we study some features of minimal answers, and show a non-finiteness property of minimal answers with no function symbols. Next, we show that SOL, which is a model-elimination-like calculus extended with Skip operation, is complete for computing not only correct answers, but also minimal answers. Unfortunately, SOL sometimes produces non-minimal answers. Thus, we next investigate another computational problem of minimal answers. We show undecidability theorems for several membership problems of the minimal answer set, which implies the impossibility of perfectly eliminating nonminimal answers. Finally, we address an extended computation problem, called conditional answer computing. SOL is also complete for computing minimal conditional answers.