Optimizing FOL reducible query answering | Zendy

AI Assistant Blog Pricing

Open Access

Optimizing FOL reducible query answering

Author(s) -

Damián Bursztyn,

François Goasdoué,

Ioana Manolescu

Publication year - 2015

Publication title -

hal (le centre pour la communication scientifique directe)

Language(s) - Uncategorized

Resource type - Conference proceedings

Subject(s) - computer science , rotation formalisms in three dimensions , query optimization , query language , set (abstract data type) , sargable , relational database , query expansion , greedy algorithm , spatial query , conjunctive query , information retrieval , boolean conjunctive query , theoretical computer science , web search query , programming language , algorithm , search engine , mathematics , geometry

The content you want is available to Zendy users.

Already have an account? Click here to sign in.

Having issues? You can contact us here

Accelerating Research

Address

John Eccles House
Robert Robinson Avenue,
Oxford Science Park, Oxford
OX4 4GP, United Kingdom

About

About Careers Publisher Partners Contact Us Get Organisational Trial or Quote

Learn

FAQs Blog Terms of Use Privacy Policy

Download the Zendy App

Download on the

Discover

Explore

Copyright Knowledge E © 2026. All Rights Reserved.