Filters








1,201 Hits in 3.1 sec

Query Answering in Circumscription

Nicolas Helft, Katsumi Inoue, David Poole
1991 International Joint Conference on Artificial Intelligence  
We address the problem of answering queries in circumscription and related nonmonotonic formalisms.  ...  In a way analogous to query answering techniques in classical predicate logic, the process extracts information from a proof of the query.  ...  Step 3 * (Test Validity) Test if E has no counter, in which case answer "Yes"; otherwise answer "No". This query answering procedure is not an exact implementation of Theorem 2.4 in one respect.  ... 
dblp:conf/ijcai/HelftIP91 fatcat:ffrzj2svfregxl7crwyrm5i3wi

Query Answering in Propositional Circumscription

Mario Alviano
2018 Proceedings of the Twenty-Seventh International Joint Conference on Artificial Intelligence  
complexity of several computational tasks increase by one level in the polynomial hierarchy due to such a preference relation;among them there is query answering, which amounts to decide whether there  ...  is an optimal model satisfying the query.A complete algorithm for query answering is obtained by searching for a model, not necessarily an optimal one, that satisfies the query, and such that no model  ...  Algorithm 1 addresses query answering in the general setting.  ... 
doi:10.24963/ijcai.2018/231 dblp:conf/ijcai/Alviano18 fatcat:6wzou26xkjelniz2t4juz7rsaq

Computing protected circumscription

Jack Minker, Donald Perlis
1985 The Journal of Logic Programming  
T his paper deals with computing circumscription in the case of Horn data with additional protection (indefinite data), an intermediate investigation between Reiter'sr esult on predicate completion and  ...  When general Horn axioms are added to the protected theory,weshowthat Horn axioms also can be used to compute sound answers; however, some correct answers will not be found.  ...  This research was supported in part by grants from the following organizations:  ... 
doi:10.1016/s0743-1066(85)80002-9 fatcat:pcspjcihtvcybdkayh6f2fm5ji

Compiling Prioritized Circumscription into Extended Logic Programs

Toshiko Wakaki, Ken Satoh
1997 International Joint Conference on Artificial Intelligence  
II, so that, whether a ground literal is provable from circumscription or not, can always be evaluated by deciding whether the literal is true in all answer sets of II, which can be computed by running  ...  In this paper, we show theoretically that any circumscription whose theory contains both the domain closure axiom and the uniqueness of names axioms can always be compiled into an extended logic program  ...  literal is provable from circumscription, can always be evaluated by deciding whether the literal is true in all answer sets of II.  ... 
dblp:conf/ijcai/WakakiS97 fatcat:l4bas32d4rbddg57ghv5k7bnq4

From Database Repair Programs to Consistent Query Answering in Classical Logic (extended abstract)

Leopoldo E. Bertossi
2009 Alberto Mendelzon Workshop on Foundations of Data Management  
In this paper we show how to use the repair programs to transform the problem of consistent query answering into a problem of reasoning wrt a concrete theory written in second-order predicate logic.  ...  Consistent answers to a query from an inconsistent database are answers that can be simultaneously retrieved from every possible repair; and repairs are consistent instances that minimally differ from  ...  Consistent query answering (CQA) in databases is about characterizing and computing answers to a query that are consistent wrt to a given set of integrity constraints.  ... 
dblp:conf/amw/Bertossi09 fatcat:lqvzflpd7jdxtbgricjbtvjida

Second-Order Specifications and Quantifier Elimination for Consistent Query Answering in Databases (Abstract)

Leopoldo Bertossi
2021 International Conference on Principles of Knowledge Representation and Reasoning  
We show how to use the repair programs to transform the problem of consistent query answering into a problem of reasoning w.r.t. a theory written in second-order predicate logic.  ...  Consistent answers to a query from a possibly inconsistent database are answers that are simultaneously retrieved from every possible repair of the database.  ...  In order to obtain the consistent answers to a FO query Q, a query program Π Q , containing a query-answer predicate Ans Q , is combined with the repair program Π(D, FD).  ... 
dblp:conf/kr/Bertossi21 fatcat:m6rizdm4snakxgca3ujgay7h4e

Second-Order Specifications and Quantifier Elimination for Consistent Query Answering in Databases [article]

Leopoldo Bertossi
2021 arXiv   pre-print
In this paper we show how to use the repair programs to transform the problem of consistent query answering into a problem of reasoning w.r.t. a theory written in second-order predicate logic.  ...  Consistent answers to a query from a possibly inconsistent database are answers that are simultaneously retrieved from every possible repair of the database.  ...  Identify and obtain logical languages that can be used for rewriting the queries in the second class, in such a way that query answering for the rewritten query can be done in polynomial time.  ... 
arXiv:2108.08423v3 fatcat:eioyahyn6vezbfo2gelxy3ycby

Page 5590 of Mathematical Reviews Vol. , Issue 96i [page]

1996 Mathematical Reviews  
Summary: “We develop a data structure for answering link dis- tance queries between two arbitrary points in a simple polygon.  ...  We show that the arrangement of S can be stored implicitly in a data structure of size O(n log’ n) so that the following query can be answered in time O(n'/?  ... 

Transforming Prioritized Defaults and Specificity into Parallel Defaults [article]

Benjamin N. Grosof
2013 arXiv   pre-print
In particular, we give a new query-answering algorithm for prioritized cirumscription which is sound and complete for the full expressive class of unrestricted finite prioritization partial orders, for  ...  ., unprioritized) defaults, in circumscription. We give an algorithm to implement the transform.  ...  Thanks also to two anonymous reviewers for helpful suggestions, some of which are incorporated only in the longer version of this paper.  ... 
arXiv:1302.4951v1 fatcat:ogqavrb57jc5zlvfzyeht4nsn4

Indefinite Reasoning with Definite Rules

L. Thorne McCarty, Ron van der Meyden
1991 International Joint Conference on Artificial Intelligence  
Second, we describe cases in which there exists a decision procedure for answering queries, a particularly significant result because it shows that it is possible to have decidable query processing in  ...  In this paper we present a novel explanation of the source of indefinite information in common sense reasoning: Indefinite information arises from reports about the world expressed in terms of concepts  ...  Our results in Section 6 improve upon this previous work in two ways: (i) we show that complete query-answering is possible even for theories whose circumscription is not first-order; and (ii) we provide  ... 
dblp:conf/ijcai/McCartyM91 fatcat:2ecufuexqncd5bc2crpgjbrjyy

Integrating Rules and Description Logics by Circumscription

Qian Yang, Jia-Huai You, Zhiyong Feng
2011 PROCEEDINGS OF THE THIRTIETH AAAI CONFERENCE ON ARTIFICIAL INTELLIGENCE AND THE TWENTY-EIGHTH INNOVATIVE APPLICATIONS OF ARTIFICIAL INTELLIGENCE CONFERENCE  
We present a new approach to characterizing the semantics for the integration of rules and first-order logic in general, and description logics in particular, based on a circumscription characterization  ...  We show that both Rosati's semantics based on NM-models and Lukasiewicz's answer set semantics can be characterized by circumscription, and the difference between the two can be seen as a matter of circumscription  ...  Acknowledgment All authors of this paper were supported in part by National Natural Science Foundation of China under grant 61070202 and 985 Project of China.  ... 
doi:10.1609/aaai.v25i1.7850 fatcat:rvkhmppoe5gdvh53gxv7ups2wq

Circumscribing embedded implications (without stratifications)

L.Thorne McCarty
1993 The Journal of Logic Programming  
This paper is a study of circumscription, not in classical logic, as usual, but in intuitionistic logic.  ...  This means that prioritized circumscription and partial circumscription entail exactly the same set of implicational queries.  ...  In general, since transitive closure cannot be defined in first-order logic [l] , there is no set of first-order sentences that will give us the intuitively correct answer to these queries.  ... 
doi:10.1016/0743-1066(93)90036-g fatcat:62rlo2fl2rajjpzu3iwcklo4o4

Database Repairs and Analytic Tableaux [article]

Leopoldo Bertossi, Camilla Schwind
2002 arXiv   pre-print
We use the tableaux based characterization as a basis for consistent query answering, that is for retrieving from the database answers to queries that are consistent wrt the integrity constraints.  ...  In this article, we characterize in terms of analytic tableaux the repairs of inconsistent relational databases, that is databases that do not satisfy a given set of integrity constraints.  ...  Preliminary versions of this paper appeared in [4, 5] ; we are grateful to anonymous referees for their remarks.  ... 
arXiv:cs/0211042v1 fatcat:y6gv455iznbzlc4sxl3cwjyg5y

Reformulating Action Language $\mathcal{C}$ + in Answer Set Programming [chapter]

Joohyung Lee
2012 Lecture Notes in Computer Science  
We present a reformulation of TAL in Answer Set Programming (ASP), and discuss some synergies it brings. First, the reformulation provides a means to compute TAL using efficient answer set solvers.  ...  Third, the reformulation allows us to compute integration of TAL and ontologies using answer set solvers, and we illustrate its usefulness in the healthcare domain in the context of medical expert systems  ...  Acknowledgements We are grateful to Jonas Kvarnström for his help on using VITAL and TALPlanner, and for answering our related questions.  ... 
doi:10.1007/978-3-642-30743-0_28 fatcat:w7kttp35tvghpndd2dgagqqyi4

Reformulating Temporal Action Logics in Answer Set Programming

Joohyung Lee, Ravi Palla
2021 PROCEEDINGS OF THE THIRTIETH AAAI CONFERENCE ON ARTIFICIAL INTELLIGENCE AND THE TWENTY-EIGHTH INNOVATIVE APPLICATIONS OF ARTIFICIAL INTELLIGENCE CONFERENCE  
We present a reformulation of TAL in Answer Set Programming (ASP), and discuss some synergies it brings. First, the reformulation provides a means to compute TAL using efficient answer set solvers.  ...  Third, the reformulation allows us to compute integration of TAL and ontologies using answer set solvers, and we illustrate its usefulness in the healthcare domain in the context of medical expert systems  ...  Acknowledgements We are grateful to Jonas Kvarnström for his help on using VITAL and TALPlanner, and for answering our related questions.  ... 
doi:10.1609/aaai.v26i1.8229 fatcat:imonphairnbl3ds36qjuci5d6e
« Previous Showing results 1 — 15 out of 1,201 results