Computing strongest necessary and weakest sufficient conditions of first-order formulas

Authors:
Patrick Doherty;Witold Łukaszewicz;Andrzej Szałas
Affiliations:
Dept. of Computer Science, Linköping University, Linköping, Sweden;Dept. of Computer Science, Linköping University and College of Economics and Computer Science, TWP, Olsztyn, Poland;Dept. of Computer Science, Linköping University and College of Economics and Computer Science, TWP, Olsztyn, Poland
Venue:
IJCAI'01 Proceedings of the 17th international joint conference on Artificial intelligence - Volume 1
Year:
2001

Citing 8
Cited 9

Knowledge compilation and theory approximation

Journal of the ACM (JACM)
A reduction result for circumscribed semi-Horn formulas

Fundamenta Informaticae - Special issue: to the memory of Prof. Helena Rasiowa
How to progress a database

Artificial Intelligence
General domain circumscription and its effective reductions

Fundamenta Informaticae
Tractable Reasoning in Artificial Intelligence

Tractable Reasoning in Artificial Intelligence
A Discipline of Programming

A Discipline of Programming
Foundations of Databases: The Logical Level

Foundations of Databases: The Logical Level
Computing Circumscription Revisited: A Reduction Algorithm

Journal of Automated Reasoning

Second-Order Quantifier Elimination in Modal Contexts

JELIA '02 Proceedings of the European Conference on Logics in Artificial Intelligence
Complexity Issues in Multiagent Logics

Fundamenta Informaticae - New Frontiers in Scientific Discovery - Commemorating the Life and Work of Zdzislaw Pawlak
Propositional independence: formula-variable independence and forgetting

Journal of Artificial Intelligence Research
Quantifier elimination in elementary set theory

RelMiCS'05 Proceedings of the 8th international conference on Relational Methods in Computer Science, Proceedings of the 3rd international conference on Applications of Kleene Algebra
Similarity, approximations and vagueness

RSFDGrC'05 Proceedings of the 10th international conference on Rough Sets, Fuzzy Sets, Data Mining, and Granular Computing - Volume Part I
On the fixpoint theory of equality and its applications

RelMiCS'06/AKA'06 Proceedings of the 9th international conference on Relational Methods in Computer Science, and 4th international conference on Applications of Kleene Algebra
Projection and scope-determined circumscription

Journal of Symbolic Computation
On progression and query evaluation in first-order knowledge bases with function symbols

IJCAI'11 Proceedings of the Twenty-Second international joint conference on Artificial Intelligence - Volume Volume Two
Complexity Issues in Multiagent Logics

Fundamenta Informaticae - New Frontiers in Scientific Discovery - Commemorating the Life and Work of Zdzislaw Pawlak

Quantified Score

Hi-index	0.00

Visualization

Abstract

A technique is proposed for computing the weakest sufficient (wsc) and strongest necessary (snc) conditions for formulas in an expressive fragment of first-order logic using quantifier elimination techniques. The efficacy of the approach is demonstrated by using the techniques to compute snc's and wsc's for use in agent communication applications, theory approximation and generation of abductive hypotheses. Additionally, we generalize recent results involving the generation of successor state axioms in the propositional situation calculus via snc's to the first-order case. Subsumption results for existing approaches to this problem and a re-interpretation of the concept of forgetting as a process of quantifier elimination are also provided.