Stem herbrand$ (all stems)

24 papers:

ESOP-2015-FrielinghausPS #interprocedural

Inter-procedural Two-Variable Herbrand Equalities (SSF, MP, HS), pp. 457–482.

TLCA-2015-AfshariHL #context-free grammar

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

CSL-2013-Rieg #using

Extracting Herbrand trees in classical realizability using forcing (LR), pp. 597–614.

ICLP-J-2013-Balduccini

ASP with non-herbrand partial functions: a language and system for practical use (MB), pp. 547–561.

CSL-2012-HetzlS #first-order #logic

Herbrand-Confluence for Cut Elimination in Classical First Order Logic (SH, LS), pp. 320–334.

ICLP-2012-Balduccini #set #source code

An Answer Set Solver for non-Herbrand Programs: Progress Report (MB), pp. 49–60.

ICLP-J-2012-LifschitzPY #modelling #null #relational

Relational theories with null values and non-herbrand stable models (VL, KP, FY), pp. 565–582.

FM-2009-SeidlVV #alias #analysis #linear #polynomial

A Smooth Combination of Linear and Herbrand Equalities for Polynomial Time Must-Alias Analysis (HS, VV, VV), pp. 644–659.

ESOP-2005-Muller-OlmSS #interprocedural

Interprocedural Herbrand Equalities (MMO, HS, BS), pp. 31–45.

LICS-2005-Maher #abduction #constraints

Herbrand Constraint Abduction (MJM), pp. 397–406.

VMCAI-2005-Muller-OlmRS

Checking Herbrand Equalities and Beyond (MMO, OR, HS), pp. 79–96.

PDCL-2004-DemoenBHMOS #constraints

Herbrand Constraints in HAL (BD, MJGdlB, WH, KM, DO, PJS), pp. 499–538.

FLOPS-2002-Garcia-DiazN #constraints #quantifier

Solving Mixed Quantified Constraints over a Domain Based on Real Numbers and Herbrand Terms (MGD, SN), pp. 103–118.

CADE-2002-GramlichP #algorithm #aspect-oriented #equation #modelling

Algorithmic Aspects of Herbrand Models Represented by Ground Atoms with Ground Equations (BG, RP), pp. 241–259.

CSL-2001-BaazM #on the #theorem

On a Generalisation of Herbrand’s Theorem (MB, GM), pp. 469–483.

PODS-2000-LechtenborgerV #on the #semantics #transaction

On Herbrand Semantics and Conflict Serializability of Read-Write Transactions (JL, GV), pp. 187–194.

KR-2000-Mota #set

Cyclical and Granular Time Theories as Subsets of the Herbrand Universe (EM), pp. 366–377.

ICLP-1999-DemoenBHMS #constraints #theorem proving

Herbrand Constraint Solving in HAL (BD, MJGdlB, WH, KM, PJS), pp. 260–274.

LICS-1999-GottlobP #complexity #modelling

Working with Arms: Complexity Results on Atomic Representations of Herbrand Models (GG, RP), pp. 306–315.

ALP-PLILP-1998-GoguenMK #theorem

A Hidden Herbrand Theorem (JAG, GM, TK), pp. 445–462.

LICS-1998-Voronkov #automation #reasoning #semantics #theorem

Herbrand’s Theorem, Automated Reasoning and Semantics Tableaux (AV), pp. 252–263.

CSL-1996-Matzinger #modelling #using

Computational Representations of Herbrand Models Using Grammars (RM), pp. 334–348.

JICSLP-1992-Cerrito #calculus #ll #unification

Herbrand Methods in Sequent Calculi: Unification in LL (SC), pp. 607–621.

JICSLP-1992-MartensS #metaprogramming #semantics

A Perfect Herbrand Semantics for Untyped Vanilla Meta-Programming (BM, DDS), pp. 511–525.