Stem axiom$ (all stems)

64 papers:

SAT-2015-ArifMM #axiom #performance

Efficient MUS Enumeration of Horn Formulae with Applications to Axiom Pinpointing (MFA, CM, JMS), pp. 324–342.

ICALP-v2-2014-AvinBLP #axiom #design #distributed #network

Distributed Computing on Core-Periphery Networks: Axiom-Based Design (CA, MB, ZL, DP), pp. 399–410.

KEOD-2014-PintoA #axiom #case study #validation

An e-Government Project Case Study — Interview based DEMO Axioms’ Benefits Validation (DP, DA), pp. 138–149.

KR-2014-Aucher #axiom #interactive

Axioms .2 and .4 as Interaction Axioms (GA).

KR-2014-Lin14a #axiom #first-order #higher-order #induction #semantics

A First-Order Semantics for Golog and ConGolog under a Second-Order Induction Axiom for Situations (FL).

IJCAR-2014-Lellmann #axiom #strict #theory and practice

Axioms vs Hypersequent Rules with Context Restrictions: Theory and Applications (BL), pp. 307–321.

LICS-CSL-2014-Ilik #axiom #decidability #morphism

Axioms and decidability for type isomorphism in the presence of sums (DI), p. 7.

WRLA-2012-GutierrezMR #axiom #order #similarity

Order-Sorted Equality Enrichments Modulo Axioms (RG, JM, CR), pp. 162–181.

CSL-2012-Aschieri #axiom #interactive

Interactive Realizability for Classical Peano Arithmetic with Skolem Axioms (FA), pp. 31–45.

CSL-2012-Hida #axiom

A Computational Interpretation of the Axiom of Determinacy in Arithmetic (TH), pp. 335–349.

CIKM-2011-ChengQ #algorithm #axiom #incremental

An algorithm for axiom pinpointing in EL+ and its incremental variant (XC, GQ), pp. 2433–2436.

GPCE-J-2009-BaggeDH11 #axiom #c++ #testing

Testing with Axioms in C++ 2011 (AHB, VD, MH), pp. 239–270.

PPDP-2011-SchernhammerM #axiom #incremental #recursion #specification

Incremental checking of well-founded recursive specifications modulo axioms (FS, JM), pp. 5–16.

SAC-2011-KasemGI #axiom

Origami axioms and circle extension (AK, FG, TI), pp. 1106–1111.

CSL-2011-MoreNS #axiom #concurrent #independence #semantics

Concurrency Semantics for the Geiger-Paz-Pearl Axioms of Independence (SMM, PN, BS), pp. 443–457.

RTA-2011-SeveriV #axiom #λ-calculus

Weakening the Axiom of Overlap in Infinitary λ Calculus (PS, FJdV), pp. 313–328.

KR-2010-PenalozaS #axiom #complexity #logic #on the #product line

On the Complexity of Axiom Pinpointing in the EL Family of Description Logics (RP, BS).

IJCAR-2010-Aderhold #automation #axiom #higher-order #induction #recursion #source code #synthesis

Automated Synthesis of Induction Axioms for Programs with Second-Order Recursion (MA), pp. 263–277.

IJCAR-2010-Kazakov #axiom #logic

An Extension of Complex Role Inclusion Axioms in the Description Logic SROIQ (YK), pp. 472–486.

TAP-2010-AhnD #axiom #first-order #logic #testing #verification

Testing First-Order Logic Axioms in Program Verification (KYA, ED), pp. 22–37.

GPCE-2009-BaggeDH #axiom #c++ #concept #testing

The axioms strike back: testing with concepts and axioms in C++ (AHB, VD, MH), pp. 15–24.

LDTA-2008-BaggeH09 #axiom #optimisation #testing

Axiom-Based Transformations: Optimisation and Testing (AHB, MH), pp. 17–33.

CADE-2009-RoedererPS #axiom #named

Divvy: An ATP Meta-system Based on Axiom Relevance Ordering (AR, YP, GS), pp. 157–162.

CADE-2009-SebastianiV #analysis #axiom #encoding #lightweight #logic

Axiom Pinpointing in Lightweight Description Logics via Horn-SAT Encoding and Conflict Analysis (RS, MV), pp. 84–99.

ASE-2008-RakamaricH #automation #axiom #static analysis #using

Automatic Inference of Frame Axioms Using Static Analysis (ZR, AJH), pp. 89–98.

KR-2008-BaaderGL #axiom #logic #ltl

LTL over Description Logic Axioms (FB, SG, CL), pp. 684–694.

CSL-2008-HermantL #approach #axiom #semantics

A Constructive Semantic Approach to Cut Elimination in Type Theories with Axioms (OH, JL), pp. 169–183.

IJCAR-2008-BaaderP #axiom

Automata-Based Axiom Pinpointing (FB, RP), pp. 226–241.

LICS-2008-CiabattoniGT #axiom #logic

From Axioms to Analytic Rules in Nonclassical Logics (AC, NG, KT), pp. 229–240.

SAC-2007-GhourabiITMK #algebra #axiom #logic

Logical and algebraic view of Huzita’s origami axioms with applications to computational origami (FG, TI, HT, MM, AK), pp. 767–772.

CADE-2007-SutcliffeP #axiom #named #semantics

SRASS — A Semantic Relevance Axiom Selection System (GS, YP), pp. 295–310.

IJCAR-2006-HendrixMO #axiom #linear #order #specification

A Sufficient Completeness Checker for Linear Order-Sorted Specifications Modulo Axioms (JH, JM, HO), pp. 151–155.

CAV-2005-McPeakN #axiom #data type #similarity #specification

Data Structure Specifications via Local Equality Axioms (SM, GCN), pp. 476–490.

CSL-2005-BrattkaS #axiom #sequence

Computing with Sequences, Weak Topologies and the Axiom of Choice (VB, MS), pp. 462–476.

FATES-2005-AiguierABGM #algebra #axiom #specification #testing

Testing from Algebraic Specifications: Test Data Set Selection by Unfolding Axioms (MA, AA, CB, PLG, BM), pp. 203–217.

CSL-2004-Kameyama #axiom #continuation

Axioms for Delimited Continuations in the CPS Hierarchy (YK), pp. 442–457.

CADE-2003-Nivelle #axiom #first-order #proving

Translation of Resolution Proofs into Short First-Order Proofs without Choice Axioms (HdN), pp. 365–379.

CADE-2003-SchmidtH #axiom #first-order

A Principle for Incorporating Axioms into the First-Order Translation of Modal Formulae (RAS, UH), pp. 412–426.

ICALP-2002-ImpagliazzoS #axiom #bound #simulation

Bounded-Depth Frege Systems with Counting Axioms Polynomially Simulate Nullstellensatz Refutations (RI, NS), pp. 208–219.

FoSSaCS-2001-HasegawaK #axiom #call-by #recursion

Axioms for Recursion in Call-by-Value (MH, YK), pp. 246–260.

FLOPS-J2-1998-Hinze01 #axiom #functional #implementation #prolog

Prolog’s Control Constructs in a Functional Setting — Axioms and Implementation (RH), pp. 125–170.

KR-2000-HorrocksT #axiom #reasoning #theory and practice

Reasoning with Axioms: Theory and Practice (IH, ST), pp. 285–296.

LICS-2000-SimpsonP #axiom #category theory #fixpoint

Complete Axioms for Categorical Fixed-Point Operators (AKS, GDP), pp. 30–41.

LICS-1999-Simpson #axiom #category theory

Elementary Axioms for Categories of Classes (AKS), pp. 77–85.

FLOPS-1998-Hinze #axiom #functional #implementation #prolog

Prological Features in a Functional Setting Axioms and Implementation (RH), pp. 98–122.

ICALP-1998-GadducciM #axiom #process

Axioms for Contextual Net Processes (FG, UM), pp. 296–308.

CSL-1997-Hollenberg #algebra #axiom #equation

Equational Axioms of Test Algebra (MH), pp. 295–310.

TLCA-1995-BerardiBC #axiom

A realization of the negative interpretation of the Axiom of Choice (SB, MB, TC), pp. 47–62.

SIGIR-1994-BruzaH #axiom #using

Investigating Aboutness Axioms using Information Fields (PB, TWCH), pp. 112–121.

LICS-1994-Meyden #axiom #distributed

Axioms for Knowledge and Time in Distributed Systems with Perfect Recall (RvdM), pp. 448–457.

ML-1991-QianI #axiom #concept #consistency

The Consistent Concept Axiom (ZQ, KBI), pp. 437–441.

ICLP-1991-Decker #axiom #on the

On Generalized Cover Axioms (HD), pp. 693–707.

CADE-1990-OzturkH #axiom #similarity

Hyper Resolution and Equality Axioms without Function Substitutions (YO, LJH), pp. 456–469.

CADE-1988-Pfenning #axiom #calculus

Single Axioms in the Implicational Propositional Calculus (FP), pp. 710–713.

VLDB-1987-SiebesK #axiom #database #design #semantics #using

Using Design Axioms and Topology to Model Database Semantics (AS, MLK), pp. 51–59.

POPL-1987-HerlihyW #axiom #concurrent

Axioms for Concurrent Objects (MH, JMW), pp. 13–26.

LICS-1986-GermanCH #axiom

True Relative Completeness of an Axiom System for the Language L4 (Abridged) (SMG, EMC, JYH), pp. 11–25.

SLP-1986-HoddinottE86 #axiom #named #prolog #similarity

PROLOG: Subsumption of Equality Axioms by the Homogeneous Form (PH, EWE), pp. 115–126.

ICALP-1984-IzumiIH #algebra #axiom #regular expression

A Complete Axiom System for Algebra of Closed-Regular Expression (HI, YI, NH), pp. 260–269.

SIGIR-1984-Bollmann #axiom #evaluation #information retrieval #metric

Two Axioms for Evaluation Measures in Information Retrieval (PB), pp. 233–245.

POPL-1984-Halpern #algol #axiom #hoare

A Good Hoare Axiom System for an Algol-like Language (JYH), pp. 262–271.

ICALP-1980-Majster-Cederbaum #algebra #axiom #fixpoint #named #semantics

Semantics: Algebras, Fixed Points, Axioms (MEMC), pp. 394–408.

ICALP-1979-Jeanrond #axiom #commutative #termination #theorem

A Unique Termination Theorem for a Theory with Generalised Commutative Axioms (HJJ), pp. 316–330.

POPL-1977-Clarke #axiom #hoare #programming language

Programming Language Constructs for Which it is Impossible to Obtain “Good” Hoare-Like Axiom Systems (EMC), pp. 10–20.