Stem conjunct$ (all stems)

99 papers:

PODS-2015-AmelootGKNS #query

Parallel-Correctness and Transferability for Conjunctive Queries (TJA, GG, BK, FN, TS), pp. 47–58.

PODS-2015-KoutrisW #complexity #consistency #constraints #query #self

The Data Complexity of Consistent Query Answering for Self-Join-Free Conjunctive Queries Under Primary Key Constraints (PK, JW), pp. 17–29.

LATA-2015-Yoshinaka #boolean grammar #grammar inference #learning

Learning Conjunctive Grammars and Contextual Binary Feature Grammars (RY), pp. 623–635.

ICLP-2015-Nys #deduction #roadmap

Advances in Analyzing Coroutines by Abstract Conjunctive Partial Deduction (VN).

LICS-2015-GogaczM #decidability #query

The Hunt for a Red Spider: Conjunctive Query Determinacy Is Undecidable (TG, JM), pp. 281–292.

PODS-2014-GrecoS #hybrid #query

Counting solutions to conjunctive queries: structural and hybrid tractability (GG, FS), pp. 132–143.

VLDB-2014-CaoFWY #bound #query

Bounded Conjunctive Queries (YC, WF, TW, WY), pp. 1231–1242.

SAS-2014-GhorbalSP #algebra #difference #equation #polynomial

Invariance of Conjunctions of Polynomial Equalities for Algebraic Differential Equations (KG, AS, AP), pp. 151–167.

CIKM-2014-BottcherLZ #equivalence #query

Pulling Conjunctive Query Equivalence out of the Bag (SB, SL, LZ), pp. 41–50.

LOPSTR-2014-SchreyeNN #compilation #deduction

Analysing and Compiling Coroutines with Abstract Conjunctive Partial Deduction (DDS, VN, CJN), pp. 21–38.

LICS-CSL-2014-ChenM #classification #complexity #graph #query

One hierarchy spawns another: graph deconstructions and the complexity classification of conjunctive queries (HC, MM), p. 10.

LICS-CSL-2014-DemriD #logic

Expressive completeness of separation logic with two variables and no separating conjunction (SD, MD), p. 10.

PODS-2013-ChenM #classification #complexity #query

The fine classification of conjunctive queries and parameterized logarithmic space complexity (HC, MM), pp. 309–320.

PODS-2013-Wijsen #query

Charting the tractability frontier of certain conjunctive query answering (JW), pp. 189–200.

DLT-2013-JezO #ambiguity #boolean grammar

Unambiguous Conjunctive Grammars over a One-Letter Alphabet (AJ, AO), pp. 277–288.

ICALP-v2-2013-ChenM #quantifier #query

Block-Sorted Quantified Conjunctive Queries (HC, DM), pp. 125–136.

DUXU-PMT-2013-CamposLNCS #process

The Conjunction Fallacy and Its Impacts in the User’s Data Acquisition Process (FC, DL, MN, WC, MMS), pp. 203–211.

PODS-2012-BarceloLR #approximate #performance #query

Efficient approximations of conjunctive queries (PB, LL, MR), pp. 249–260.

PODS-2012-FaginK #equivalence

Local transformations and conjunctive-query equivalence (RF, PGK), pp. 179–190.

FM-2012-JohnsonGMDE #case study #hybrid #verification

Satellite Rendezvous and Conjunction Avoidance: Case Studies in Verification of Nonlinear Hybrid Systems (TTJ, JG, SM, RD, RSE), pp. 252–266.

KR-2012-KikotKZ #owl #query

Conjunctive Query Answering with OWL 2 QL (SK, RK, MZ).

CSL-2012-Brault-Baron #query

A Negative Conjunctive Query is Easy if and only if it is β-Acyclic (JBB), pp. 137–151.

LICS-2012-ChenD #quantifier

Decomposing Quantified Conjunctive (or Disjunctive) Formulas (HC, VD), pp. 205–214.

PODS-2011-KimelfeldVW

Maximizing conjunctive views in deletion propagation (BK, JV, RW), pp. 187–198.

PODS-2011-KoutrisS #evaluation #parallel #query

Parallel evaluation of conjunctive queries (PK, DS), pp. 223–234.

STOC-2011-GuptaHRU #query #statistics

Privately releasing conjunctions and the statistical query barrier (AG, MH, AR, JU), pp. 803–812.

SAC-2011-ZhengC #database #query

Determinacy and rewriting of conjunctive queries over unary database schemas (LZ, HC), pp. 1039–1044.

SAT-2011-KullmannZ #normalisation #on the

On Variables with Few Occurrences in Conjunctive Normal Forms (OK, XZ), pp. 33–46.

PODS-2010-Wijsen #database #first-order #nondeterminism #on the #query

On the first-order expressibility of computing certain answers to conjunctive queries over uncertain databases (JW), pp. 179–190.

STOC-2010-Marx #constraints #query

Tractable hypergraph properties for constraint satisfaction and conjunctive queries (DM), pp. 735–744.

KR-2010-GlimmR #decidability #query

Status QIO: Conjunctive Query Entailment Is Decidable (BG, SR).

LOPSTR-2010-Vidal #approach #hybrid #logic programming #partial evaluation #source code

A Hybrid Approach to Conjunctive Partial Evaluation of Logic Programs (GV), pp. 200–214.

CSL-2010-BaganDFG #performance #query

Efficient Enumeration for Conjunctive Queries over X-underbar Structures (GB, AD, EF, OG), pp. 80–94.

PODS-2009-GottlobLV #bound #query

Size and treewidth bounds for conjunctive queries (GG, STL, GV), pp. 45–54.

SIGMOD-2009-OlteanuH #query

Secondary-storage confidence computation for conjunctive queries with inequalities (DO, JH), pp. 389–402.

SAC-2009-YeeNF #peer-to-peer #query

Alternatives to conjunctive query processing in peer-to-peer file-sharing systems (WGY, LTN, OF), pp. 1737–1741.

SAT-2009-Traxler #normalisation

Variable Influences in Conjunctive Normal Forms (PT), pp. 101–113.

DLT-J-2007-Jez08 #boolean grammar

Conjunctive Grammars Generate Non-Regular Unary Languages (AJ), pp. 597–615.

KR-2008-GlimmHS #query

Unions of Conjunctive Queries in SHOQ (BG, IH, US), pp. 252–262.

IJCAR-2008-Lutz #complexity #logic #query

The Complexity of Conjunctive Query Answering in Expressive Description Logics (CL), pp. 179–193.

ICDAR-2007-NguyenBML #classification #using #verification

Off-line Signature Verification Using Enhanced Modified Direction Features in Conjunction with Neural Classifiers and Support Vector Machines (VN, MB, VM, GL), pp. 734–738.

PODS-2007-DalviS07a #probability #query

The dichotomy of conjunctive queries on probabilistic structures (NND, DS), pp. 293–302.

DLT-2007-Jez #boolean grammar

Conjunctive Grammars Can Generate Non-regular Unary Languages (AJ), pp. 242–253.

ECIR-2007-MeenaP #analysis #sentiment #using

Sentence Level Sentiment Analysis in the Presence of Conjuncts Using Linguistic Analysis (AM, TVP), pp. 573–580.

CSL-2007-BaganDG #constant #on the #query

On Acyclic Conjunctive Queries and Constant Delay Enumeration (GB, AD, EG), pp. 208–222.

PODS-2006-JayramKV #problem #query

The containment problem for REAL conjunctive queries with inequalities (TSJ, PGK, EV), pp. 80–89.

VLDB-2006-CaliK

Containment of Conjunctive Object Meta-Queries (AC, MK), pp. 942–952.

FoSSaCS-2006-LuttgenV #process #semantics

Conjunction on Processes: Full-Abstraction Via Ready-Tree Semantics (GL, WV), pp. 261–276.

CAiSE-2006-Al-MuhammedE #constraints

Resolving Underconstrained and Overconstrained Systems of Conjunctive Constraints for Service Requests (MAM, DWE), pp. 223–238.

SAT-2006-KullmannLM #agile #categorisation #kernel #normalisation #satisfiability

Categorisation of Clauses in Conjunctive Normal Forms: Minimally Unsatisfiable Sub-clause-sets and the Lean Kernel (OK, IL, JMS), pp. 22–35.

VLDB-2005-MarklMKTHS

Consistently Estimating the Selectivity of Conjuncts of Predicates (VM, NM, MK, TMT, PJH, US), pp. 373–384.

ESOP-2005-LeuschelV #deduction #slicing

Forward Slicing by Conjunctive Partial Deduction and Argument Filtering (ML, GV), pp. 61–76.

SAT-J-2004-BaulandCCHV05 #algebra #approach #complexity #query

An Algebraic Approach to the Complexity of Generalized Conjunctive Queries (MB, PC, NC, MH, HV), pp. 30–45.

PODS-2004-AtseriasDK #morphism #on the #query

On Preservation under Homomorphisms and Unions of Conjunctive Queries (AA, AD, PGK), pp. 319–329.

PODS-2004-GottlobKS #query

Conjunctive Queries over Trees (GG, CK, KUS), pp. 189–200.

SIGMOD-2004-AyadN #infinity #optimisation #query

Static Optimization of Conjunctive Queries with Sliding Windows Over Infinite Streams (AA, JFN), pp. 419–430.

TACAS-2004-GrooteK #equation #fixpoint

Solving Disjunctive/Conjunctive Boolean Equation Systems with Alternating Fixed Points (JFG, MK), pp. 436–450.

SAS-2004-KuncakR #logic

Generalized Records and Spatial Conjunction in Role Logic (VK, MCR), pp. 361–376.

SAT-2004-BaulandCCHV #algebra #approach #complexity #query

An Algebraic Approach to the Complexity of Generalized Conjunctive Queries (MB, PC, NC, MH, HV), pp. 181–190.

DAC-2003-DamianoK #satisfiability

Checking satisfiability of a conjunction of BDDs (RFD, JHK), pp. 818–823.

PODS-2002-Chirkova #bound #problem #query

The View-Selection Problem Has an Exponential-Time Lower Bound for Conjunctive Queries and Views (RC), pp. 159–168.

PODS-2002-Ross #in memory #memory management

Conjunctive Selection Conditions in Main Memory (KAR), pp. 109–120.

TACAS-2002-JinKS #analysis #reachability #scheduling

Fine-Grain Conjunction Scheduling for Symbolic Reachability Analysis (HJ, AK, FS), pp. 312–326.

CIAA-2002-Okhotin #linear #performance #recognition

Efficient Automaton-Based Recognition for Linear Conjunctive Languages (AO), pp. 169–181.

CIAA-2002-Okhotin02a #boolean grammar #generative #parsing

Whale Calf, a Parser Generator for Conjunctive Grammars (AO), pp. 213–220.

DLT-2002-Okhotin #automaton #linear #representation

Automaton Representation of Linear Conjunctive Languages (AO), pp. 393–404.

ICALP-2002-EstebanGM #bound #complexity #on the

On the Complexity of Resolution with Bounded Conjunctions (JLE, NG, JM), pp. 220–231.

CIKM-2002-DeshpandeK #classification #using

Using conjunction of attribute values for classification (MD, GK), pp. 356–364.

SAT-2002-Kullmann #adaptation #branch #database #encryption #normalisation #random #satisfiability #standard #towards #using

Towards an adaptive density based branching rule for SAT solvers, using a database for mixed random conjunctive normal forms built upon the Advanced Encryption Standard (AES) (OK), p. 8.

ASE-2001-Kong #implementation #interactive #specification

Implementation of Specification Conjunction and Domain Interaction in Rosetta (CK), p. 435.

HT-2001-Rosenberg #hypermedia

And And: conjunctive hypertext and the structure acteme juncture (JR), pp. 51–60.

STOC-2001-GroheSS #evaluation #query #question

When is the evaluation of conjunctive queries tractable? (MG, TS, LS), pp. 657–666.

LOPSTR-2001-LeuschelG #deduction #model checking #using

Abstract Conjunctive Partial Deduction Using Regular Types and Its Application to Model Checking (ML, SG), pp. 91–110.

KR-2000-CalvaneseGLV #query

Containment of Conjunctive Regular Path Queries with Inverse (DC, GDG, ML, MYV), pp. 176–185.

CL-2000-ChirkovaG #bound #database

Linearly Bounded Reformulations of Conjunctive Databases (RC, MRG), pp. 987–1001.

PODS-1998-FlorescuLS #query #regular expression

Query Containment for Conjunctive Queries with Regular Expressions (DF, AYL, DS), pp. 139–148.

PODS-1998-KolaitisMT #complexity #on the #problem #query

On the Complexity of the Containment Problem for Conjunctive Queries with Built-in Predicates (PGK, DLM, MNT), pp. 197–204.

PODS-1998-KolaitisV #constraints

Conjunctive-Query Containment and Constraint Satisfaction (PGK, MYV), pp. 205–213.

PODS-1997-AlbertIR #equivalence #query #relational

Conjunctive Query Equivalence of Keyed Relational Schemas (JA, YEI, RR), pp. 44–50.

CIKM-1997-Lukasiewicz #deduction #knowledge base #performance #probability #taxonomy

Efficient Global Probabilistic Deduction from Taxonomic and Probabilistic Knowledge-Bases over Conjunctive Events (TL), pp. 75–82.

CSL-1997-Olive #linear #logic #nondeterminism

A Conjunctive Logical Characterization of Nondeterministic Linear Time (FO), pp. 360–372.

LOPSTR-1996-JorgensenLM #deduction

Conjunctive Partial Deduction in Practice (JJ, ML, BM), pp. 59–82.

PLILP-1996-GluckJMS #deduction

Controlling Conjunctive Partial Deduction (RG, JJ, BM, MHS), pp. 152–166.

CAV-1996-McMillan #model checking #representation

A Conjunctively Decomposed Boolean Representation for Symbolic Model Checking (KLM), pp. 13–25.

PODS-1993-ChaudhuriV #optimisation #query

Optimization of Real Conjunctive Queries (SC, MYV), pp. 59–70.

FPCA-1993-Lillie #type system

Conjunctive Subtyping (DJL), pp. 42–51.

PODS-1992-Chan #query

Containment and Minimization of Positive Conjunctive Queries in OODB’s (EPFC), pp. 202–211.

ML-1992-ConverseH #learning

Learning to Satisfy Conjunctive Goals (TMC, KJH), pp. 117–122.

ML-1990-PazzaniS #algorithm #analysis #learning

Average Case Analysis of Conjunctive Learning Algorithms (MJP, WS), pp. 339–347.

PODS-1989-Elkan #query

A Decision Procedure for Conjunctive Query Disjointness (CE), pp. 134–139.

POPL-1989-Monteleone

Generalized Conjunctive Types (GM), pp. 242–249.

JICSCP-1988-Abramson88 #approach #aspect-oriented #definite clause grammar #metaprogramming

Metarules and an Approach to Conjunction in Definite Clause Translation Grammars: Some Aspects of Grammatical Metaprogramming (HA), pp. 233–248.

CSL-1987-LenzW #complexity #polynomial

The Conjunctive Complexity of Quadratic Boolean Functions (KL, IW), pp. 138–150.

LICS-1987-Reynolds #algol

Conjunctive Types and Algol-like Languages (JCR), p. 119.

PODS-1982-JohnsonK #dependence #functional #query #testing

Testing Containment of Conjunctive Queries Under Functional and Inclusion Dependencies (DSJ, ACK), pp. 164–169.

VLDB-1980-RosenkrantzH #query

Processing Conjunctive Predicates and Queries (DJR, HBHI), pp. 64–72.

VLDB-1979-Svensson #on the #order #performance #query

On Search Performance for Conjunctive Queries in Compressed, Fully Transposed Ordered Files (PS), pp. 155–163.

STOC-1977-ChandraM #database #implementation #query #relational

Optimal Implementation of Conjunctive Queries in Relational Data Bases (AKC, PMM), pp. 77–90.

POPL-1977-Soisalon-Soininen #lr #parsing #reduction

Elimination of Single Productions from LR Parsers in Conjunction with the Use of Default Reductions (ESS), pp. 183–193.