Stem disjunct$ (all stems)

133 papers:

CSL-2015-BaazF #logic

Elementary Elimination of Prenex Cuts in Disjunction-free Intuitionistic Logic (MB, CGF), pp. 94–109.

TLCA-2015-AfshariHL #context-free grammar

Herbrand Disjunctions, Cut Elimination and Context-Free Tree Grammars (BA, SH, GEL), pp. 1–16.

KR-2014-AsuncionZZ #first-order #logic programming #semantics #source code

Logic Programs with Ordered Disjunction: First-Order Semantics and Expressiveness (VA, YZ, HZ).

PPDP-J-2012-SchrijversDTD14 #composition #named

Tor: Modular search with hookable disjunction (TS, BD, MT, BD), pp. 101–120.

ICSE-2014-NguyenKWF #dynamic analysis #invariant #using

Using dynamic analysis to generate disjunctive invariants (TN, DK, WW, SF), pp. 608–619.

CASE-2013-IordacheWZA #design #performance #petri net #specification

Efficient design of Petri-net supervisors with disjunctive specifications (MVI, PW, FZ, PJA), pp. 936–941.

PODS-2013-BienvenuCLW #case study #csp #data access #datalog #ontology

Ontology-based data access: a study through disjunctive datalog, CSP, and MMSNP (MB, BtC, CL, FW), pp. 213–224.

ICML-c1-2013-BalcanBEL #learning #performance

Efficient Semi-supervised and Active Learning of Disjunctions (NB, CB, SE, YL), pp. 633–641.

CAV-2013-RummerHK #verification

Disjunctive Interpolants for Horn-Clause Verification (PR, HH, VK), pp. 347–363.

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

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

PPDP-2012-SchrijversTD #named

Tor: extensible search with hookable disjunction (TS, MT, BD), pp. 103–114.

ICLP-2012-OetschPT #constraints #semantics #source code

An FLP-Style Answer-Set Semantics for Abstract-Constraint Programs with Disjunctions (JO, JP, HT), pp. 222–234.

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-ChenD #quantifier

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

ICALP-v1-2011-NgoPR #matrix

Efficiently Decodable Error-Correcting List Disjunct Matrices and Applications — (Extended Abstract) (HQN, EP, AR), pp. 557–568.

ECIR-2011-JonassenB #performance

Efficient Compressed Inverted Index Skipping for Disjunctive Text-Queries (SJ, SEB), pp. 530–542.

CAV-2011-ChinGVLCQ #calculus #verification

A Specialization Calculus for Pruning Disjunctive Predicates to Support Verification (WNC, CG, RV, QLL, FC, SQ), pp. 293–309.

KR-2010-Arieli #logic #on the

On the Application of the Disjunctive Syllogism in Paraconsistent Logics Based on Four States of Information (OA).

ICLP-2010-Alviano10 #datalog #set #source code

Dynamic Magic Sets for Disjunctive Datalog Programs (MA), pp. 226–235.

ICLP-2010-RiguzziS10 #logic programming #reasoning #source code

Tabling and Answer Subsumption for Reasoning on Logic Programs with Annotated Disjunctions (FR, TS), pp. 162–171.

ICLP-J-2010-AlvianoFL #decidability #effectiveness #query

Disjunctive ASP with functions: Decidable queries and effective computation (MA, WF, NL), pp. 497–512.

ICLP-2009-ChenJL #logic programming #source code

Computing Loops with at Most One External Support Rule for Disjunctive Logic Programs (XC, JJ, FL), pp. 130–144.

ESOP-2008-Allamigeon #abstraction #array

Non-disjunctive Numerical Domain for Array Predicate Abstraction (XA), pp. 163–177.

KR-2008-DrescherGGKKOS #set

Conflict-Driven Disjunctive Answer Set Solving (CD, MG, TG, BK, AK, MO, TS), pp. 422–432.

KR-2008-FaberTW #equivalence #logic programming #order #source code

Notions of Strong Equivalence for Logic Programs with Ordered Disjunction (WF, HT, SW), pp. 433–443.

SAC-2008-DouillardJ #constraints #heuristic

Splitting heuristics for disjunctive numerical constraints (TD, CJ), pp. 140–144.

CSL-2008-ColcombetL #calculus #problem #μ-calculus

The Nesting-Depth of Disjunctive μ-Calculus for Tree Languages and the Limitedness Problem (TC, CL), pp. 416–430.

ICLP-2008-PuhrerTW #source code

Elimination of Disjunction and Negation in Answer-Set Programs under Hyperequivalence (JP, HT, SW), pp. 561–575.

ICLP-2008-Riguzzi #logic programming #semantics #source code

Inference with Logic Programs with Annotated Disjunctions under the Well Founded Semantics (FR), pp. 667–671.

SIGIR-2007-VelipasaogluSP #constraints #learning

Improving active learning recall via disjunctive boolean constraints (EV, HS, JOP), pp. 893–894.

ICLP-2007-OikarinenJ #linear #logic programming

A Linear Transformation from Prioritized Circumscription to Disjunctive Logic Programming (EO, TJ), pp. 440–441.

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

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

DATE-2006-WangYIG #embedded #image #verification

Disjunctive image computation for embedded software verification (CW, ZY, FI, AG), pp. 1205–1210.

VLDB-2006-CohenFKKS

Full Disjunctions: Polynomial-Delay Iterators in Action (SC, IF, YK, BK, YS), pp. 739–750.

SAS-2006-SankaranarayananISG #static analysis

Static Analysis in Disjunctive Numerical Domains (SS, FI, IS, AG), pp. 3–17.

CIKM-2006-KuntschkeK #data type #evaluation

Matching and evaluation of disjunctive predicates for data stream sharing (RK, AK), pp. 832–833.

KR-2006-Rosati #datalog #integration #logic

DL+log: Tight Integration of Description Logics and Disjunctive Datalog (RR), pp. 68–78.

PODS-2005-CohenS #algorithm #incremental

An incremental algorithm for computing ranked full disjunctions (SC, YS), pp. 98–107.

CIKM-2005-CoutoSC #correlation #ontology #product line #semantics #similarity

Semantic similarity over the gene ontology: family correlation and selecting disjunctive ancestors (FMC, MJS, PC), pp. 343–344.

MLDM-2005-ShimizuM #anti #sequence

Disjunctive Sequential Patterns on Single Data Sequence and Its Anti-monotonicity (KS, TM), pp. 376–383.

ICLP-2005-AlcantaraDP #semantics

A Well-Founded Semantics with Disjunction (JA, CVD, LMP), pp. 341–355.

TACAS-2004-GrooteK #equation #fixpoint

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

SAS-2004-ManevichSRF #abstraction

Partially Disjunctive Heap Abstraction (RM, SS, GR, JF), pp. 265–279.

KR-2004-EiterFTW #logic programming #on the

On Eliminating Disjunctions in Stable Logic Programming (TE, MF, HT, SW), pp. 447–458.

KR-2004-HustadtMS #datalog #logic #source code

Reducing SHIQ-Description Logic to Disjunctive Datalog Programs (UH, BM, US), pp. 152–162.

KR-2004-LiuLL #logic #reasoning

A Logic of Limited Belief for Reasoning with Disjunctive Information (YL, GL, HJL), pp. 587–597.

SAC-2004-Kryszkiewicz

Reducing borders of k-disjunction free representations of frequent patterns (MK), pp. 559–563.

ICLP-2004-CumboFGL #datalog #source code

Enhancing the Magic-Set Method for Disjunctive Datalog Programs (CC, WF, GG, NL), pp. 371–385.

ICLP-2004-VennekensVB #logic programming #source code

Logic Programs with Annotated Disjunctions (JV, SV, MB), pp. 431–445.

PODS-2003-KanzaS

Computing full disjunctions (YK, YS), pp. 78–89.

ICFP-2003-BeffaraD #exception #normalisation

Disjunctive normal forms and local exceptions (EB, VD), pp. 203–211.

PPDP-2003-GrecoZ #bound #datalog #on the #performance #query

On the rewriting and efficient computation of bound disjunctive datalog queries (SG, EZ), pp. 136–147.

ICLP-2003-LeeL #logic programming #source code

Loop Formulas for Disjunctive Logic Programs (JL, VL), pp. 451–465.

KR-2002-Lakemeyer #first-order #knowledge base #reasoning

Evaluation-Based Reasoning with Disjunctive Information in First-Order Knowledge Bases (GL), pp. 73–81.

ICLP-2002-Bonatti #infinity #modelling #reasoning #source code

Reasoning with Infinite Stable Models II: Disjunctive Programs (PAB), pp. 333–346.

ICLP-2002-InoueS

Disjunctive Explanations (KI, CS), pp. 317–332.

ICLP-2002-PearceSSTW #logic programming #polynomial #source code

A Polynomial Translation of Logic Programs with Nested Expressions into Disjunctive Logic Programs: Preliminary Report (DP, VS, TS, HT, SW), pp. 405–420.

CIKM-2001-NanavatiCJK #mining

Mining Generalised Disjunctive Association Rules (AAN, KPC, SJ, RK), pp. 482–489.

IJCAR-2001-Wang #semantics #top-down

A Top-Down Procedure for Disjunctive Well-Founded Semantics (KW), pp. 305–317.

TLCA-2001-Groote #deduction #normalisation

Strong Normalization of Classical Natural Deduction with Disjunction (PdG), pp. 182–196.

KR-2000-JanhunenNSY #semantics

Unfolding Partiality and Disjunctions in Stable Model Semantics (TJ, IN, PS, JHY), pp. 411–422.

CAV-2000-Rushby #diagrams #invariant #verification

Verification Diagrams Revisited: Disjunctive Invariants for Easy Verification (JMR), pp. 508–520.

CSL-2000-DanosK

Disjunctive Tautologies as Synchronisation Schemes (VD, JLK), pp. 292–301.

ICLP-1999-BuccafurriFL #inheritance #logic programming #source code

Disjunctive Logic Programs with Inheritance (FB, WF, NL), pp. 79–93.

ICLP-1999-Greco #optimisation #query

Optimization of Disjunctive Queries (SG), pp. 441–455.

DATE-1998-SawadaYN #detection #logic

Restructuring Logic Representations with Easily Detectable Simple Disjunctive Decompositions (HS, SY, AN), pp. 755–759.

VLDB-1998-Greco #database

Binding Propagation in Disjunctive Databases (SG), pp. 287–298.

ICML-1998-WeissH #problem

The Problem with Noise and Small Disjuncts (GMW, HH), p. 574–?.

KR-1998-BrassDNP #comparison #implementation #semantics

A Comparison of the Static and the Disjunctive Well-Founded Semantics and its Implementation (SB, JD, IN, TCP), pp. 74–85.

KR-1998-BuccafurriLR #logic #order #semantics

Disjunctive Ordered Logic: Semantics and Expressiveness (FB, NL, PR), pp. 418–431.

JICSLP-1998-McAloon #linear #logic programming #research

Disjunctive Linear Programming: At the Intersection of Operations Research and Logic Programming (KM), pp. 5–6.

JICSLP-1998-YouYG #semantics

Regular Extension Semantics and Disjunctive Eshghi Kowalski Procedure (JHY, LYY, RG), pp. 175–189.

DAC-1997-CabodiCLQ #approach #clustering #effectiveness #scalability #traversal

Disjunctive Partitioning and Partial Iterative Squaring: An Effective Approach for Symbolic Traversal of Large Circuits (GC, PC, LL, SQ), pp. 728–733.

ICLP-1997-BaumgartnerF #calculus #logic programming

Calculi for Disjunctive Logic Programming (PB, UF), p. 409.

ICLP-1997-YouWY #logic programming

Disjunctive Logic Programming as Constrained Inferences (JHY, XW, LYY), pp. 361–375.

ILPS-1997-BaumgartnerF #calculus #logic programming

Calculi for Disjunctive Logic Programming (PB, UF), pp. 229–243.

ILPS-1997-SeipelMR #database #modelling

A Characterization of the Partial Stable Models For Disjunctive Databases (DS, JM, CR), pp. 245–259.

PODS-1996-RajaramanU

Integrating Information by Outerjoins and Full Disjunctions (AR, JDU), pp. 238–248.

ESOP-1996-GiacobazziR #abstract interpretation #composition #optimisation

Compositional Optimization of Disjunctive Abstract Interpretations (RG, FR), pp. 141–155.

ICML-1996-Sebag #approach #bias

Delaying the Choice of Bias: A Disjunctive Version Space Approach (MS), pp. 444–452.

KR-1996-KambhampatiY #constraints #on the #refinement

On the Role of Disjunctive Representations and Constraint Propagation in Refinement Planning (SK, XY), pp. 135–146.

JICSLP-1996-Ngo #database #deduction #probability

Probabilistic Disjunctive Deductive Databases (Poster Abstract) (LN), p. 541.

VLDB-1995-SteinbrunnPMK #query

Bypassing Joins in Disjunctive Queries (MS, KP, GM, AK), pp. 228–238.

DLT-1995-Ilie #on the

On Disjunctivity, Ultimate Periodicity and Ultimate Identity (LI), pp. 44–53.

ICML-1995-Weiss #learning

Learning with Rare Cases and Small Disjuncts (GMW), pp. 558–565.

PLILP-1995-ShimajiriSI #database #logic #query

Goal-Directed Query Processing in Disjunctive Logic Databases (YS, HS, HI), pp. 415–430.

ICLP-1995-BrassD #bottom-up #evaluation #semantics

Disjunctive Semantics based upon Partial and Bottom-Up Evaluation (SB, JD), pp. 199–213.

ICLP-1995-CarlsonC #compilation #constraints #finite

Compiling and Executing Disjunctions of Finite Domain Constraints (BC, MC), pp. 117–131.

ICLP-1995-ShimajiriSI #database #logic #query

Making Query Processing Goal-Directed in Disjunctive Logic Databases (YS, HS, HI), p. 820.

ILPS-1995-LeoneS #declarative #fixpoint #modelling

Declarative and Fixpoint Characterizations of Disjunctive Stable Models (NL, FS), pp. 399–413.

LICS-1995-NadathurL #logic programming #proving

Uniform Proofs and Disjunctive Logic Programming (Extended Abstract) (GN, DWL), pp. 148–155.

PODS-1994-EiterGM #datalog

Adding Disjunction to Datalog (TE, GG, HM), pp. 267–278.

SIGMOD-1994-Galindo-Legaria

Outerjoins as Disjunctions (CAGL), pp. 348–358.

SIGMOD-1994-KemperMPS #optimisation #query

Optimizing Disjunctive Queries with Expensive Predicates (AK, GM, KP, MS), pp. 336–347.

ICML-1994-GiordanaSZ #algorithm #concept #learning #search-based

Learning Disjunctive Concepts by Means of Genetic Algorithms (AG, LS, FZ), pp. 96–104.

KR-1994-GereviniS #performance #reasoning

An Efficient Method for Managing Disjunctions in Qualitative Temporal Reasoning (AG, LKS), pp. 214–225.

LOPSTR-1994-SakamaS #approach #declarative #deduction #logic programming #source code

Partial Deduction of Disjunctive Logic Programs: A Declarative Approach (CS, HS), pp. 170–182.

ICLP-1994-DixGM #logic programming #modelling #source code

Causal Models of Disjunctive Logic Programs (JD, GG, VWM), pp. 290–302.

ICLP-1994-DixM #approach #axiom #semantics #source code

An Axiomatic Approach to Semantics of Disjunctive Programs (JD, MM), pp. 303–320.

ICLP-1994-SakamaI #abduction #equivalence #logic programming #on the #source code

On the Equivalence between Disjunctive and Abductive Logic Programs (CS, KI), pp. 489–503.

ILPS-1994-Gottlob #complexity #logic programming #power of

Complexity and Expressive Power of Disjunctive Logic Programming (GG), pp. 23–42.

PODS-1993-EiterG #aspect-oriented #complexity #database #semantics

Complexity Aspects of Various Semantics for Disjunctive Databases (TE, GG), pp. 158–167.

ICML-1993-DanylukP #fault #learning #network

Small Disjuncts in Action: Learning to Diagnose Errors in the Local Loop of the Telephone Network (APD, FJP), pp. 81–88.

PLILP-1993-JourdanS #constraints

The Versatility of Handling Disjunctions as Constraints (JJ, TS), pp. 60–74.

ICLP-1993-BackerB #constraints #linear

A CLP Language Handling Disjunctions of Linear Constraints (BDB, HB), pp. 550–563.

ICLP-1993-InoueS #abduction #logic programming #source code

Transforming Abductive Logic Programs to Disjunctive Programs (KI, CS), pp. 335–353.

ICLP-1993-SakamaI #logic programming #source code

Negation in Disjunctive Logic Programs (CS, KI), pp. 703–719.

ILPS-1993-BruningHSTS #deduction

Disjunction In Resource-Oriented Deductive Planning (SB, SH, UCS, MT, JS), p. 670.

ILPS-1993-EiterG #complexity #logic #logic programming

Complexity Results for Disjunctive Logic Programming and Application to Nonmonotonic Logics (TE, GG), pp. 266–278.

ICALP-1992-Zhang

Disjunctive Systems and L-Domains (GQZ), pp. 284–295.

KR-1992-SchragBC #reasoning

Managing Disjunction for Practical Temporal Reasoning (RS, MB, JC), pp. 36–46.

JICSLP-1992-Ben-EliyahuD #logic programming #source code

Propositional Sematics for Disjunctive Logic Programs (RBE, RD), pp. 813–827.

JICSLP-1992-Dix #logic programming #semantics #source code

Classifying Semantics of Disjunctive Logic Programs (JD), pp. 798–812.

LICS-1992-Jensen #analysis #strict

Disjunctive Strictness Analysis (TPJ), pp. 174–185.

ICLP-1991-FernandezM #bottom-up #database #deduction #evaluation

Bottom-Up Evaluation of Hierarchical Disjunctive Deductive Databases (JAF, JM), pp. 660–675.

ISLP-1991-ReedLS #logic programming #source code

An Alternative Characterization of Disjunctive Logic Programs (DWR, DWL, BTS), pp. 54–68.

PODS-1990-Royer #evaluation

Backward Chaining Evaluation in Stratified Disjunctive Theories (VR), pp. 183–195.

ML-1990-McCallumS #algorithm #search-based #using

Using Genetic Algorithms to Learn Disjunctive Rules from Examples (AM, KAS), pp. 149–152.

CLP-1990-Przymusinski90 #semantics #source code

Extended Stable Semantics for Normal and Disjunctive Programs (TCP), pp. 459–477.

NACLP-1990-Lobo #logic programming #on the #source code

On Constructive Negation for Disjunctive Logic Programs (JL), pp. 704–718.

NACLP-1990-Przymusinski #database #deduction #logic programming #semantics #source code

Stationary Semantics for Disjunctive Logic Programs and Deductive Databases (TCP), pp. 40–59.

PODS-1989-YuanC #algorithm #database #evaluation #query #relational

A Sound and Complete Query Evaluation Algorithm for Relational Databases with Disjunctive Information (LYY, DAC), pp. 66–74.

SIGMOD-1989-Bry #evaluation #performance #quantifier #query #revisited #towards

Towards an Efficient Evaluation of General Queries: Quantifier and Disjunction Processing Revisited (FB), pp. 193–204.

KR-1989-BorgidaE #knowledge base #performance #reasoning

Hierarchical Knowledge Bases and Efficient Disjunctive Reasoning (AB, DWE), pp. 33–43.

KR-1989-RajasekarLM #reasoning #source code

Skeptical Reasoning and Disjunctive Programs (AR, JL, JM), pp. 349–356.

CSL-1989-Vogler #database #deduction #semantics

The Semantics of Disjunctive Deductive Databases (HV), pp. 409–421.

NACLP-1989-Minker #logic programming #towards

Toward A Foundation of Disjunctive Logic Programming (JM), pp. 1215–1235.

NACLP-1989-RajasekarM #semantics #source code

A Stratification Semantics for General Disjunctive Programs (AR, JM), pp. 573–586.

PODS-1988-MuralikrishnaD #multi #optimisation #query

Optimization of Multiple-Relation Multiple-Disjunct Queries (MM, DJD), pp. 263–275.

CSL-1988-Ambos-SpiesK #on the #self

On Disjunctive Self-Reducibility (KAS, JK), pp. 1–13.

VLDB-1987-WhangN #approach #logic #normalisation #optimisation #query #recursion

An Extended Disjunctive Normal Form Approach for Optimizing Recursive Logic Queries in Loosely Coupled Environments (KYW, SBN), pp. 275–287.

ICLP-1986-PooleG86 #prolog

Gracefully adding negation and disjunction to Prolog (DP, RG), pp. 635–641.

ICALP-1984-AtzeniM #constraints #database #dependence #functional #null

Functional Dependencies and Disjunctive Existence Constraints in Database Relations with Null Values (PA, NMM), pp. 69–81.