18,230 Hits in 4.0 sec

A SAT-based System for Consistent Query Answering [article]

Akhil A. Dixit, Phokion G. Kolaitis
2019 arXiv   pre-print
We designed, implemented, and evaluated CAvSAT, a SAT-based system for consistent query answering.  ...  These results provide evidence that a SAT-based approach can give rise to a comprehensive and scalable system for consistent query answering.  ...  In this paper, we report on a SAT-based system for consistent query answering, which we call CAvSAT (Consistent Answers via SAT).  ... 
arXiv:1905.02828v1 fatcat:kprpgamqqveuvf36gdyx5c7z7i

Consistent Answers of Aggregation Queries using SAT Solvers [article]

Akhil A. Dixit, Phokion G. Kolaitis
2021 arXiv   pre-print
We describe the first system able to compute the consistent answers of general aggregation queries with the COUNT(A), COUNT(*), SUM(A), MIN(A), and MAX(A) operators, and with or without grouping constructs  ...  The framework of database repairs and consistent answers to queries is a principled approach to managing inconsistent databases.  ...  We then designed, implemented, and evaluated AggCAvSAT, a SAT-based system for computing range consistent answers to aggregation queries involving COUNT(A), COUNT(*), SUM(A), and grouping.  ... 
arXiv:2103.03314v3 fatcat:qbobf4lynjgkpa7nks5ns333ve

Learning Finite-State Machines from Inexperienced Teachers [chapter]

Olga Grinchtein, Martin Leucker
2006 Lecture Notes in Computer Science  
For this, queries on how the underlying system behaves may be issued.  ...  Extended Abstract - The general goal of query-based learning algorithms for finite-state machines is to identify a machine, usually of minimum size, that agrees with an a priori fixed (class of) machines  ...  For this, queries on how the underlying system behaves may be issued.  ... 
doi:10.1007/11872436_30 fatcat:zskt5yewjrhgljnnydpiwnprtm

Predicting User Satisfaction with Intelligent Assistants

Julia Kiseleva, Kyle Williams, Ahmed Hassan Awadallah, Aidan C. Crook, Imed Zitouni, Tasos Anastasakos
2016 Proceedings of the 39th International ACM SIGIR conference on Research and Development in Information Retrieval - SIGIR '16  
Predicting success and failure of such search dialogues is a new problem, and an important one for evaluating and further improving intelligent assistants.  ...  able to improve the prediction accuracy of user satisfaction from 71% to 81% over a baseline that utilizes only click and query features.  ...  Acknowledgments We thank the help from Sarvesh Nagpal and Toby Walker for the help in collecting the internal API data for the user study.  ... 
doi:10.1145/2911451.2911521 dblp:conf/sigir/KiselevaWACZA16 fatcat:u2isb2lmizejrnyvy5hspztoai

Reformulation-based query answering in RDF

Damian Bursztyn, François Goasdoué, Ioana Manolescu
2015 Proceedings of the VLDB Endowment  
Two main query answering techniques have been devised, namely Saturation-based (Sat) which precomputes and adds to the graph all implicit information, and Reformulation-based (Ref) which reformulates the  ...  Answering queries over Semantic Web data, i.e., RDF graphs, must account for both explicit data and implicit data, entailed by the explicit data and the semantic constraints holding on them.  ...  We use Sat to designate the saturation-based query answering technique outlined above. Sat is rather simple and well-understood.  ... 
doi:10.14778/2824032.2824093 fatcat:mup6z6ytfre3xn235latfdnxey

QAestro – Semantic-Based Composition of Question Answering Pipelines [chapter]

Kuldeep Singh, Ioanna Lytra, Maria-Esther Vidal, Dharmen Punjani, Harsh Thakkar, Christoph Lange, Sören Auer
2017 Lecture Notes in Computer Science  
Question Answering (QA) systems address this need by answering questions posed by humans using knowledge bases.  ...  Furthermore, the problem of QA component composition is mapped to the problem of LAV query rewriting, and state-of-the-art SAT solvers are utilized to efficiently enumerate the solutions.  ...  , (4) Answer Generation Module for executing SPARQL queries to get the answers.  ... 
doi:10.1007/978-3-319-64468-4_2 fatcat:irmql5jrzbbdfof7jsmgirgs4e

Moara: Flexible and Scalable Group-Based Querying System [chapter]

Steven Y. Ko, Praveen Yalagandula, Indranil Gupta, Vanish Talwar, Dejan Milojicic, Subu Iyer
2008 Lecture Notes in Computer Science  
Though there exist several distributed querying systems for this monitoring purpose, they are not group-based; they mostly focus on querying the entire system.  ...  In this paper, we present Moara, a new querying system that makes two novel contributions.  ...  These requirements point to the need for a group-based querying system that can provide instantaneous answers to queries over in-situ data targeting one or more groups.  ... 
doi:10.1007/978-3-540-89856-6_21 fatcat:vlqqaslfufawxmh74o4huvt6iu

How Do Gain and Discount Functions Affect the Correlation between DCG and User Satisfaction? [chapter]

Julián Urbano, Mónica Marrero
2015 Lecture Notes in Computer Science  
In particular, we estimate the probabilities that users find a system satisfactory given a DCG score, and that they agree with a difference in DCG as to which of two systems is more satisfactory.  ...  We study this relationship for 36 combinations of gain and discount, and find that a linear gain and a constant discount are best correlated with user satisfaction.  ...  We thank the reviewers for their comments.  ... 
doi:10.1007/978-3-319-16354-3_20 fatcat:ukkzgmhjdfd57m2vokazuf3syu

Inferring Network Invariants Automatically [chapter]

Olga Grinchtein, Martin Leucker, Nir Piterman
2006 Lecture Notes in Computer Science  
Given a system P , a network invariant for P is a system that abstracts the composition of every number of copies of P running in parallel.  ...  The search is based on algorithms for learning finite automata due to Angluin and Biermann. We optimize the search by combining both algorithms for improving successive possible invariants.  ...  Acknowledgment We thank Bengt Jonsson and Christian Schallhart for valuable comments and discussions.  ... 
doi:10.1007/11814771_40 fatcat:gjusem4ssnaa7a537mbgfkzzii

Computing and Explaining Query Answers over Inconsistent DL-Lite Knowledge Bases

Meghyn Bienvenu, Camille Bourgaux, François Goasdoué
2019 The Journal of Artificial Intelligence Research  
Several inconsistency-tolerant semantics have been introduced for querying inconsistent description logic knowledge bases.  ...  The second issue tackled in this work is explaining why a tuple is a (non-)answer to a query under these semantics.  ...  Encouraged by the performance of modern-day SAT solvers, we proposed a practical SAT-based approach for query answering in DL-Lite R under the AR semantics, using the IAR and brave semantics as tractable  ... 
doi:10.1613/jair.1.11395 fatcat:5o7b52euq5duhei6m4mrp2lnba

Collaborative caching for spatial queries in Mobile P2P Networks

Qijun Zhu, Dik Lun Lee, Wang-Chien Lee
2011 2011 IEEE 27th International Conference on Data Engineering  
We implement two SECC schemes, namely, the periodical and adaptive SAT-based schemes, with different SAT maintenance policies.  ...  By introducing a novel index structure called Signature Augment Tree (SAT), we address two crucial issues in SECC.  ...  ) for SAT-based SECC schemes.  ... 
doi:10.1109/icde.2011.5767874 dblp:conf/icde/ZhuLL11 fatcat:cqcue5nf25dutpn66lkkcjaqze

Preliminary results on Ontology-based Open Data Publishing [article]

Gianluca Cima
2017 arXiv   pre-print
In this paper we argue that the Ontology-based Data Management paradigm can provide a formal basis for a principled approach to publish high quality, semantically annotated Open Data.  ...  Despite the current interest in Open Data publishing, a formal and comprehensive methodology supporting an organization in deciding which data to publish and carrying out precise procedures for publishing  ...  I under the certain answers-based semantics is a query over O such that, when we compute its certain answers for a source database C, we get all the answers of the evaluation of Q s over C.  ... 
arXiv:1705.10480v2 fatcat:f66ztuumx5fvdgx53gtgr6jj6m

The Sixth Answer Set Programming Competition

Martin Gebser, Marco Maratea, Francesco Ricca
2017 The Journal of Artificial Intelligence Research  
Answer Set Programming (ASP) is a well-known paradigm of declarative programming with roots in logic programming and non-monotonic reasoning.  ...  On the other hand, it featured also some novelties, like a benchmark selection stage classifying instances according to their empirical hardness, and a "Marathon" track where the top-performing systems  ...  A ground query a? holds for P , if a belongs to every answer set of P .  ... 
doi:10.1613/jair.5373 fatcat:pjgjrinsc5a2xk4trq6sp22r2u

Knowledge-Assisted Reasoning of Model-Augmented System Requirements with Event Calculus and Goal-Directed Answer Set Programming

Brendan Hall, Sarat Chandra Varanasi, Jan Fiedor, Joaquín Arias, Kinjal Basu, Fang Li, Devesh Bhatt, Kevin Driscoll, Elmer Salazar, Gopal Gupta
2021 Electronic Proceedings in Theoretical Computer Science  
We show how cyber-physical systems' requirements can be modeled using the event calculus (EC), a formalism used in AI for representing actions and change.  ...  We also show how answer set programming (ASP) and its query-driven implementation s(CASP) can be used to directly realize the event calculus model of the requirements.  ...  The s(ASP) and s(CASP) systems only explore the parts of the knowledge-base that are needed to answer the query, and they provide a proof tree that serves as justification for the query.  ... 
doi:10.4204/eptcs.344.6 fatcat:zavsqo7oindfxj7swvbk6trjba

On Finding an Inference-Proof Complete Database for Controlled Query Evaluation [chapter]

Joachim Biskup, Lena Wiese
2006 Lecture Notes in Computer Science  
We illustrate the semantics of the system by a comprehensive example and state the essential requirements for an inference-proof and highly available database.  ...  Controlled Query Evaluation (CQE) offers a logical framework to prevent a user of a database from inadvertently gaining knowledge he is not allowed to know.  ...  Acknowledgements This work was funded by the German Research Council (DFG) under a grant for the Research Training Group (Graduiertenkolleg) "Mathematical and Engineering Methods for Secure Data Transfer  ... 
doi:10.1007/11805588_3 fatcat:5pdbvoypqbfvhfm5frpm6m6rbi
« Previous Showing results 1 — 15 out of 18,230 results