Stem entail$ (all stems)

34 papers:

LICS-2015-AtseriasB #probability

Entailment among Probabilistic Implications (AA, JLB), pp. 621–632.

KEOD-2014-ParviziMDRP #ontology

Selecting Ontology Entailments for Presentation to Users (AP, CM, KvD, YR, JZP), pp. 382–387.

SAC-2014-GaubatzHZS #collaboration #constraints #documentation #editing #realtime #web

Enforcing entailment constraints in offline editing scenarios for real-time collaborative web documents (PG, WH, UZ, MS), pp. 735–742.

IJCAR-2014-BeyersdorffC #complexity #proving #theorem proving

The Complexity of Theorem Proving in Circumscription and Minimal Entailment (OB, LC), pp. 403–417.

SAC-2013-GaubatzZ #collaboration #constraints #web

Supporting entailment constraints in the context of collaborative web applications (PG, UZ), pp. 736–741.

SAC-2012-BelohlavekV #database #semantics #similarity

Attribute implications in similarity-based databases: semantic entailment and nonredundant bases (RB, VV), pp. 840–846.

IJCAR-2012-ChekolEGL #query

SPARQL Query Containment under RDFS Entailment Regime (MWC, JE, PG, NL), pp. 134–148.

RTA-2012-CousineauH #proving #semantics

A Semantic Proof that Reducibility Candidates entail Cut Elimination (DC, OH), pp. 133–148.

TACAS-2011-GargM #composition

Compositionality Entails Sequentializability (PG, PM), pp. 26–40.

CIKM-2011-WuQD #owl #pipes and filters #using

Finding all justifications of OWL entailments using TMS and MapReduce (GW, GQ, JD), pp. 1425–1434.

CADE-2011-BrotherstonDP #automation #logic #proving

Automated Cyclic Entailment Proofs in Separation Logic (JB, DD, RLP), pp. 131–146.

KR-2010-GlimmR #decidability #query

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

KDIR-2009-GoyalBM #query #using

Entailment of Causal Queries in Narratives using Action Language (PG, LB, TMM), pp. 112–118.

KR-2008-Bochman

Default Theory of Defeasible Entailment (AB), pp. 466–475.

ECIR-2006-ClinchantGG #information retrieval

Lexical Entailment for Information Retrieval (SC, CG, ÉG), pp. 217–228.

ICLP-2004-RayBR #kernel #set

Generalised Kernel Sets for Inverse Entailment (OR, KB, AR), pp. 165–179.

SAS-2003-KuncakR #abstraction #decidability

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

ICLP-2003-Rao #polynomial

Polynomial-Time Learnability from Entailment (MRKKR), pp. 489–491.

KR-2002-Lin #equivalence #logic programming #source code

Reducing Strong Equivalence of Logic Programs to Entailment in Classical Propositional Logic (FL), pp. 170–176.

ESOP-2001-SuA #constraints #similarity

Entailment with Conditional Equality Constraints (ZS, AA), pp. 170–189.

CL-2000-HolldoblerS #calculus #diagrams #problem #using

Solving the Entailment Problem in the Fluent Calculus Using Binary Decision Diagrams (SH, HPS), pp. 747–761.

LICS-1999-NiehrenMT #constraints #set

Entailment of Atomic Set Constraints is PSPACE-Complete (JN, MM, JMT), pp. 285–294.

ICALP-1998-HengleinR #automaton #complexity #constraints #recursion #type system

Constraint Automata and the Complexity of Recursive Subtype Entailment (FH, JR), pp. 616–627.

ICML-1998-ReddyT #first-order #learning #source code

Learning First-Order Acyclic Horn Programs from Entailment (CR, PT), pp. 472–480.

LICS-1997-HengleinR #complexity #type system

The Complexity of Subtype Entailment for Simple Types (FH, JR), pp. 352–361.

KR-1996-TeijeH #approximate #using

Computing Approximate Diagnoses By Using Approximate Entailment (AtT, FvH), pp. 256–265.

KR-1994-MoinardR

Preferential Entailments for Circumscriptions (YM, RR), pp. 461–472.

ICLP-1994-CarlsonCD #constraints #finite

Entailment of Finite Domain Constraints (BC, MC, DD), pp. 339–353.

ILPS-1994-PodelskiR #algorithm #incremental #testing

The Beauty and the Beast Algorithm: Quasi-Linear Incremental Tests of Entailment and Disentailment over Trees (AP, PVR), pp. 359–374.

ICML-1993-FrazierP #learning

Learning From Entailment: An Application to Propositional Horn Sentences (MF, LP), pp. 120–127.

CADE-1992-CaferraD #logic #proving #semantics

Semantic Entailment in Non Classical Logics Based on Proofs Found in Classical Logic (RC, SD), pp. 385–399.

KR-1989-Lehmann #knowledge base #question #what

What Does a Conditional Knowledge Base Entail? (DJL), pp. 212–222.

NACLP-1989-Suchenek

A Syntactic Characterization of Minimal Entailment (MAS), pp. 81–91.

ESOP-1986-Stark #concept #proving #specification

Proving Entailment Between Conceptual State Specifications (EWS), pp. 197–209.