Stem justif$ (all stems)

25 papers:

ICLP-2015-DamasioMA #debugging #source code

Unifying Justifications and Debugging for Answer-Set Programs (CVD, JM, AA).

KEOD-2014-FreibergHP #knowledge-based #novel #paradigm

Clarification KBS as Consultation-Justification Mash Ups — Proposing a Novel Paradigm for All-in-One Knowledge-based Systems (MF, FH, FP), pp. 168–175.

ICLP-J-2014-CabalarFF #graph #logic programming #source code

Causal Graph Justifications of Logic Programs (PC, JF, MF), pp. 603–618.

ICML-2012-ChenLL #algorithm #online

An Online Boosting Algorithm with Theoretical Justifications (STC, HTL, CJL), p. 243.

KR-2012-HorridgePS #ontology

Justification Masking in Ontologies (MH, BP, US).

DUXU-v2-2011-NemeryBK #design #persuasion #social #user interface #validation

First Validation of Persuasive Criteria for Designing and Evaluating the Social Influence of User Interfaces: Justification of a Guideline (AN, EB, SK), pp. 616–624.

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

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

KR-2010-HorridgeP #ontology #proving #towards

From Justifications Towards Proofs for Ontology Engineering (MH, BP).

CIKM-2009-KanoulasA #empirical

Empirical justification of the gain and discount function for nDCG (EK, JAA), pp. 611–620.

ICLP-2006-PontelliS #logic programming #semantics #set #source code

Justifications for Logic Programs Under Answer Set Semantics (EP, TCS), pp. 196–210.

FLOPS-2004-PemmasaniGDRR #logic programming #online #source code

Online Justification for Tabled Logic Programs (GP, HFG, YD, CRR, IVR), pp. 24–38.

ICML-2003-OntanonP #learning #multi

Justification-based Multiagent Learning (SO, EP), pp. 576–583.

ICLP-2003-PemmasaniGDRR #logic programming #online #source code

Online Justification for Tabled Logic Programs (GP, HFG, YD, CRR, IVR), pp. 500–501.

LOPSTR-2002-GuoRR #program transformation

Justification Based on Program Transformation (HFG, CRR, IVR), pp. 158–159.

ICLP-2001-GuoRR

Speculative Beats Conservative Justification (HFG, CRR, IVR), pp. 150–165.

ICPR-v2-2000-ZhouLC

A Theoretical Justification of Nearest Feature Line Method (ZZ, SZL, KLC), pp. 2759–2762.

FM-v2-1999-BoerHR #approach #concurrent #paradigm #semantics

Formal Justification of the Rely-Guarantee Paradigm for Shared-Variable Concurrency: A Semantic Approach (FSdB, UH, WPdR), pp. 1245–1265.

DAC-1997-CongHKNSY #2d #analysis

Analysis and Justification of a Simple, Practical 2 1/2-D Capacitance Extraction Methodology (JC, LH, ABK, DN, NS, SHCY), pp. 627–632.

TRI-Ada-1996-RybinS #ada #difference

Ada and ASIS: Justification of Differences in Terminology and Mechanisms (SR, AS), pp. 249–254.

KDD-1991-SchlimmerMM #refinement

Justification-Based Refinement of Expert Knowledge (JCS, TMM, JPM), pp. 397–410.

ML-1991-TecuciM #adaptation #learning #multi

A Method for Multistrategy Task-Adaptive Learning Based on Plausible Justifications (GT, RSM), pp. 549–553.

ML-1989-BirnbaumCK

Issues in the Justification-Based Diagnosis of Planning Failures (LB, GC, BK), pp. 194–196.

VDME-1987-Jones87a #proving

VDM Proof Obligations and their Justification (CBJ), pp. 260–286.

DAC-1980-Powell #analysis

Justification and financial analysis for CAD (REP), pp. 564–571.

DAC-1969-Radke #predict

A justification of, and an improvement on, a useful rule for predicting circuit-to-pin ratios (CER), pp. 257–267.