Stem existenti$ (all stems)

60 papers:

PODS-2015-AlvianoP

Default Negation for Non-Guarded Existential Rules (MA, AP), pp. 79–90.

PODS-2015-CalauttiGP #termination

Chase Termination for Guarded Existential Rules (MC, GG, AP), pp. 91–103.

SOSP-2015-LuVAHSTKL #comprehension #consistency #facebook

Existential consistency: measuring and understanding consistency at Facebook (HL, KV, PA, JH, YJS, WT, SK, WL), pp. 295–310.

PODS-2014-GottlobRS

Expressiveness of guarded existential rule languages (GG, SR, MS), pp. 27–38.

KR-2014-GottlobHKL #logic #semantics

Stable Model Semantics for Guarded Existential Rules and Description Logics (GG, AH, CK, TL).

KR-2014-GottlobMP #polynomial

Polynomial Combined Rewritings for Existential Rules (GG, MM, AP).

LICS-CSL-2014-BovaGS #logic #model checking #order #set

Model checking existential logic on partially ordered sets (SB, RG, SS), p. 10.

CAV-2013-BeyenePR #horn clause #quantifier

Solving Existentially Quantified Horn Clauses (TAB, CP, AR), pp. 869–882.

ICLP-J-2013-GottlobMP #decidability #paradigm

Combining decidability paradigms for existential rules (GG, MM, AP), pp. 877–892.

ICLP-J-2013-YouZZ #logic programming #quantifier #source code

Disjunctive logic programs with existential quantification in rule heads (JHY, HZ, YZ), pp. 563–578.

KR-2012-BordeauxJSM #on the #quantifier

On Unit-Refutation Complete Formulae with Existentially Quantified Variables (LB, MJ, JPMS, PM).

KR-2012-ThomazoBMR #algorithm #query #set

A Generic Querying Algorithm for Greedy Sets of Existential Rules (MT, JFB, MLM, SR).

ICLP-J-2012-AlvianoFLM #complexity #datalog #decidability #quantifier #semantics

Disjunctive datalog with existential quantifiers: Semantics, decidability, and complexity issues (MA, WF, NL, MM), pp. 701–718.

LICS-2012-Berkholz #bound #game studies #testing

Lower Bounds for Existential Pebble Games and k-Consistency Tests (CB), pp. 25–34.

KEOD-2011-AhmedMB #approach #dependence #ontology

Existential Dependency Driven Approach for Extracting Views from Domain Ontology (SSA, MM, SMB), pp. 413–418.

CAV-2011-BrauerKK #incremental #quantifier #satisfiability

Existential Quantification as Incremental SAT (JB, AK, JK), pp. 191–207.

KR-2010-BagetLM #decidability

Walking the Decidability Line for Rules with Existential Variables (JFB, ML, MLM).

SAT-2010-BubeckB #quantifier

Rewriting (Dependency-)Quantified 2-CNF with Arbitrary Free Literals into Existential 2-HORN (UB, HKB), pp. 58–70.

ESOP-2009-CameronD #quantifier

Existential Quantification for Variant Ownership (NRC, SD), pp. 128–142.

POPL-2009-MontaguR #data type #modelling

Modeling abstract types in modules with open existential types (BM, DR), pp. 354–365.

RTA-2009-Schubert #parallel

The Existential Fragment of the One-Step Parallel Rewriting Theory (AS), pp. 78–92.

TLCA-2009-FujitaS #type system

Existential Type Systems with No Types in Terms (KeF, AS), pp. 112–126.

TLCA-2009-Miquel

Relating Classical Realizability and Negative Translation for Existential Witness Extraction (AM), pp. 188–202.

ICSE-2008-SibayUB #revisited #sequence chart

Existential live sequence charts revisited (GES, SU, VAB), pp. 41–50.

ICLP-2008-SenniPP #algorithm #constraints #logic programming #source code

A Folding Algorithm for Eliminating Existential Variables from Constraint Logic Programs (VS, AP, MP), pp. 284–300.

TLCA-2007-Tatsuta #higher-order #quantifier #set

Simple Saturated Sets for Disjunction and Second-Order Existential Quantification (MT), pp. 366–380.

SAS-2006-PratikakisFH #reachability

Existential Label Flow Inference Via CFL Reachability (PP, JSF, MH), pp. 88–106.

SAC-2006-GrandonG #approximate #constraints #distance #parametricity #quantifier

Inner approximation of distance constraints with existential quantification of parameters (CG, AG), pp. 1660–1661.

ICLP-2006-PettorossiPS #constraints #logic programming #proving #source code

Proving Properties of Constraint Logic Programs by Eliminating Existential Variables (AP, MP, VS), pp. 179–195.

SAC-2005-Behrend #database #deduction #optimisation #query

Optimizing existential queries in stratifiable deductive databases (AB), pp. 623–628.

LICS-2005-Rossman

Existential Positive Types and Preservation under Homomorphisisms (BR), pp. 467–476.

TLCA-2005-Fujita #polymorphism

Galois Embedding from Polymorphic Types into Existential Types (KeF), pp. 194–208.

TACAS-2003-HenzingerKM #calculus #on the #μ-calculus

On the Universal and Existential Fragments of the μ-Calculus (TAH, OK, RM), pp. 49–64.

SAS-2003-KuncakR #abstraction #decidability

Existential Heap Abstraction Entailment Is Undecidable (VK, MCR), pp. 418–438.

ICFP-2003-Simonet #bound #data type

An extension of HM(X) with bounded existential and universal data-types (VS), pp. 39–50.

CSL-2003-KolaitisP #complexity #game studies #on the

On the Complexity of Existential Pebble Games (PGK, JP), pp. 314–329.

ICLP-2003-FarreTU

Handling Existential Derived Predicates in View Updating (CF, ET, TU), pp. 148–162.

LICS-2003-FederV #morphism

Homomorphism Closed vs. Existential Positive (TF, MYV), pp. 311–320.

ESOP-2002-Grossman #imperative

Existential Types for Imperative Languages (DG), pp. 21–35.

CSL-2001-GroheW #locality #theorem

An Existential Locality Theorem (MG, SW), pp. 99–114.

ESOP-2000-HeatonHK #abstract domain

Abstract Domains for Universal and Existential Properties (AH, PMH, AK), pp. 150–164.

KR-2000-BaaderK #concept #strict

Matching Concept Descriptions with Existential Restrictions (FB, RK), pp. 261–272.

LICS-2000-KorovinV #algebra

A Decision Procedure for the Existential Theory of Term Algebras with the Knuth-Bendix Ordering (KK, AV), pp. 291–302.

RTA-1999-HofbauerH #testing

Test Sets for the Universal and Existential Closure of Regular Tree Languages (DH, MH), pp. 205–219.

RTA-1999-LimetR #decidability

A New Result about the Decidability of the Existential One-Step Rewriting Theory (SL, PR), pp. 118–132.

TLCA-1999-PollZ #data type #logic

A Logic for Abstract Data Types as Existential Types (EP, JZ), pp. 310–324.

ICALP-1998-BorchertKS #first-order #on the

On Existentially First-Order Definable Languages and Their Relation to NP (BB, DK, FS), pp. 17–28.

ICALP-1998-Pitts #equivalence #logic

Existential Types: Logical Relations and Operational Equivalence (AMP), pp. 309–326.

LICS-1998-Bars #higher-order #logic

Fragments of Existential Second-Order Logic without 0-1 Laws (JMLB), pp. 525–536.

LICS-1998-EiterGG #higher-order #logic #string

Existential Second-Order Logic over Strings (TE, GG, YG), pp. 16–27.

ALP-1997-AbdennadherS #constraints #generative #quantifier

Model Generation with Existentially Quantified Variables and Constraints (SA, HS), pp. 256–272.

CSL-1997-Schwentick #higher-order #logic #power of

Padding and the Expressive Power of Existential Second-Order Logics (TS), pp. 461–477.

ICALP-1996-Pin #automaton #calculus #first-order #power of

The Expressive Power of Existential First Order Sentences of Büchi’s Sequential Calculus (JÉP), pp. 300–311.

CAV-1995-Kupferman #branch #logic #quantifier

Augmenting Branching Temporal Logics with Existential Quantification over Atomic Propositions (OK), pp. 325–338.

ILPS-1995-LauOPP #correctness #logic programming #program transformation #termination

Correctness of Logic Program Transformations Based on Existential Termination (KKL, MO, AP, MP), pp. 480–494.

LICS-1991-PacholskiS #higher-order #on the #similarity

On the 0-1 Law for the class of Existential Second Order Minimal Gödel Sentences with Equality (LP, WS), pp. 280–285.

CSL-1989-Dahlhaus #complexity #linear

The Complexity of Subtheories of the Existential Linear Theory of Reals (ED), pp. 76–89.

PODS-1988-RamakrishnanBK #datalog #optimisation #query

Optimizing Existential Datalog Queries (RR, CB, RK), pp. 89–102.

POPL-1985-MitchellP #data type

Abstract Types Have Existential Type (JCM, GDP), pp. 37–51.

ICALP-1979-BroyDPPW #data type #quantifier

Existential Quantifiers in Abstract Data Types (MB, WD, HP, PP, MW), pp. 73–87.