BibSLEIGH — reasoning tag

reasoning

reasoning

Tag #reasoning

910 papers:

PADL-2020-ErikssonP #diagrams #domain-specific language #integer: A DSL for Integer Range Reasoning: Partition, Interval and Mapping Diagrams (JE, MP), pp. 196–212.
POPL-2020-HandleyVH #haskell #resource management: Liquidate your assets: reasoning about resource usage in liquid Haskell (MATH, NV, GH), p. 27.
POPL-2020-HinrichsenBK #logic #named: Actris: session-type based reasoning in separation logic (JKH, JB, RK), p. 30.
EDM-2019-TatoND #hybrid #network #predict: Hybrid Deep Neural Networks to Predict Socio-Moral Reasoning Skills (AANT, RN, AD).
FM-2019-BrenasES #database #query: Reasoning Formally About Database Queries and Updates (JHB, RE, MS), pp. 556–572.
FM-2019-ZhaoSZ0 #concurrent #framework #parametricity: A Parametric Rely-Guarantee Reasoning Framework for Concurrent Reactive Systems (YZ, DS, FZ, YL0), pp. 161–178.
ICFP-2019-Morihata #algebra #equation #parallel #reduction #λ-calculus: Lambda calculus with algebraic simplification for reduction parallelization by equational reasoning (AM), p. 25.
ICFP-2019-OrchardLE: Quantitative program reasoning with graded modal types (DO, VBL, HEI), p. 30.
VS-Games-2019-TahaiWEP #adaptation #design #evaluation #game studies #named: Scalebridge: Design and Evaluation of Adaptive Difficulty Proportional Reasoning Game for Children (LT, JRW, CE, KP), pp. 1–4.
CIKM-2019-HuUMH #datalog #knowledge base #rdf: Datalog Reasoning over Compressed RDF Knowledge Bases (PH, JU, BM, IH), pp. 2065–2068.
CIKM-2019-Wang0C #graph #learning #recommendation: Learning and Reasoning on Graph for Recommendation (XW, XH0, TSC), pp. 2971–2972.
ICML-2019-WangDWK #learning #logic #named #satisfiability #using: SATNet: Bridging deep learning and logical reasoning using a differentiable satisfiability solver (PWW, PLD, BW, JZK), pp. 6545–6554.
ECOOP-2019-TurcotteAR #interface #modelling: Reasoning About Foreign Function Interfaces Without Modelling the Foreign Language (AT, EA, GR), p. 32.
OOPSLA-2019-EssertelWR #precise: Precise reasoning with structured time, structured heaps, and collective operations (GME, GW, TR), p. 30.
PLDI-2019-HeoRSN #difference #source code #using: Continuously reasoning about programs using differential Bayesian inference (KH, MR, XS, MN), pp. 561–575.
POPL-2019-BatzKKMN #logic #pointer #probability #source code: Quantitative separation logic: a logic for reasoning about probabilistic pointer programs (KB, BLK, JPK, CM, TN0), p. 29.
POPL-2019-SatoABGGH #approximate #convergence #higher-order #optimisation #probability #source code #verification: Formal verification of higher-order probabilistic programs: reasoning about approximation, convergence, Bayesian inference, and optimization (TS, AA0, GB, MG, DG0, JH), p. 30.
SAS-2019-Naik #static analysis: Rethinking Static Analysis by Combining Discrete and Continuous Reasoning (MN), pp. 3–16.
ICSE-2019-BaeLR #android #comprehension #towards: Towards understanding and reasoning about Android interoperations (SB, SL, SR), pp. 223–233.
CASE-2019-PitschlP #adaptation #maintenance #mobile #persistent #using: Obstacle Persistent Adaptive Map Maintenance for Autonomous Mobile Robots using Spatio-temporal Reasoning (MLP, MWP), pp. 1023–1028.
CGO-2019-SunBSB #graph #using: Reasoning about the Node.js Event Loop using Async Graphs (HS, DB, FS, WB), pp. 61–72.
ESOP-2019-FruminGK #automation #c #nondeterminism: Semi-automated Reasoning About Non-determinism in C Expressions (DF, LG, RK), pp. 60–87.
ESOP-2019-McDermottM #call-by #evaluation #order #source code: Extended Call-by-Push-Value: Reasoning About Effectful Programs and Evaluation Order (DM, AM), pp. 235–262.
CADE-2019-SternagelW #equation #order: Certified Equational Reasoning via Ordered Completion (CS, SW), pp. 508–525.
CADE-2019-Tammet #knowledge base #named #scalability: GKC: A Reasoning System for Large Knowledge Bases (TT), pp. 538–549.
CAV-2019-JainM #composition: Local and Compositional Reasoning for Optimized Reactive Systems (MJ, PM), pp. 553–571.
CAV-2019-ZhaoS #concurrent #memory management: Rely-Guarantee Reasoning About Concurrent Memory Management in Zephyr RTOS (YZ, DS), pp. 515–533.
SANER-2018-HanLLXF #graph #named: DeepWeak: Reasoning common software weaknesses via knowledge graph embedding (ZH, XL0, HL, ZX, ZF0), pp. 456–466.
FM-2018-AmericoAM #algebra #approach #data flow: An Algebraic Approach for Reasoning About Information Flow (AA, MSA, AM), pp. 55–72.
FM-2018-ZhangZSLTLS #composition #concurrent #source code: Compositional Reasoning for Shared-Variable Concurrent Programs (FZ, YZ, DS, YL0, AT, SWL, JS0), pp. 523–541.
IFM-2018-BoermanHJ #difference #ml: Reasoning About JML: Differences Between KeY and OpenJML (JB, MH, SJCJ), pp. 30–46.
Haskell-2018-VazouBKHH #equation #functional #haskell #proving #theorem proving: Theorem proving for all: equational reasoning in liquid Haskell (functional pearl) (NV, JB, RK, DVH, GH), pp. 132–144.
ICFP-2018-KaiserZKRD #coq #named: Mtac2: typed tactics for backward reasoning in Coq (JOK, BZ, RK, YRG, DD), p. 31.
CIKM-2018-DasGZ #datalog #named: ASTRO: A Datalog System for Advanced Stream Reasoning (AD, SMG, CZ), pp. 1863–1866.
ECIR-2018-HaugGG #multi: Neural Multi-step Reasoning for Question Answering on Semi-structured Tables (TH, OEG, PG), pp. 611–617.
ICML-2018-SantoroHBML #network: Measuring abstract reasoning in neural networks (AS, FH, DGTB, ASM, TPL), pp. 4477–4486.
Onward-2018-GavranMMPZ #automation #collaboration #named: Tᴏᴏʟ: accessible automated reasoning for human robot collaboration (IG, OM, RM, RP, DZ), pp. 44–56.
OOPSLA-2018-WangCB #query #relational: Speeding up symbolic reasoning for relational queries (CW, AC, RB), p. 25.
PLDI-2018-FerlesGDS #automation: Symbolic reasoning for automatic signal placement (KF, JVG, ID, YS), pp. 120–134.
PLDI-2018-RaghothamanKHN #using: User-guided program reasoning using Bayesian inference (MR, SK, KH, MN), pp. 722–735.
POPL-2018-ChandraB #named #type system: Bonsai: synthesis-based reasoning for type systems (KC, RB), p. 34.
POPL-2018-KakiNNJ #composition: Alone together: compositional reasoning and inference for weak isolation (GK, KN, MN, SJ), p. 34.
POPL-2018-KincaidCBR #invariant #synthesis: Non-linear reasoning for invariant synthesis (ZK, JC, JB, TWR), p. 33.
ESEC-FSE-2018-ErataGKT #automation #first-order #logic #named #relational: AlloyInEcore: embedding of first-order relational logic into meta-object facility for automated model reasoning (FE, AG, IK, BT), pp. 920–923.
CC-2018-DemangeRP #semantics: Semantic reasoning about the sea of nodes (DD, YFdR, DP), pp. 163–173.
ESOP-2018-0001BBBG0 #markov #probability #relational #λ-calculus: Relational Reasoning for Markov Chains in a Probabilistic Guarded Lambda Calculus (AA0, GB, LB, AB, MG, DG0), pp. 214–241.
ESOP-2018-LeH #logic: Logical Reasoning for Disjoint Permissions (XBL, AH), pp. 385–414.
ESOP-2018-SkorstengaardDB #pointer #stack: Reasoning About a Machine with Local Capabilities - Provably Safe Stack and Return Pointer Management (LS, DD, LB), pp. 475–501.
CAV-2018-Cook #security #web #web service: Formal Reasoning About the Security of Amazon Web Services (BC), pp. 38–47.
CAV-2018-BouajjaniEMT #abstraction #reduction #source code #using: Reasoning About TSO Programs Using Reduction and Abstraction (AB, CE, SOM, ST), pp. 336–353.
CSL-2018-0001R #induction #infinity #logic #transitive: Uniform Inductive Reasoning in Transitive Closure Logic via Infinite Descent (LC0, RNSR), p. 16.
CSL-2018-AngiuliF0 #type system: Cartesian Cubical Computational Type Theory: Constructive Reasoning with Paths and Equalities (CA, KBH(, RH0), p. 17.
IJCAR-2018-HannulaL #automation #set: Automated Reasoning About Key Sets (MH, SL), pp. 47–63.
IJCAR-2018-HernandezK #abstraction #framework #scalability: An Abstraction-Refinement Framework for Reasoning with Large Theories (JCLH, KK), pp. 663–679.
CSEET-2017-HeymSBSPHKS #case study #component #contract #education #experience #multi: Integrating Components, Contracts, and Reasoning in CS Curricula with RESOLVE: Experiences at Multiple Institutions (WDH, PAGS, PB, MS, KP, JEH, JK, NS), pp. 202–211.
EDM-2017-TatoND #automation #detection #network: Convolutional Neural Network for Automatic Detection of Sociomoral Reasoning Level (AANT, RN, AD).
IFM-2017-Linker #higher-order #safety: Spatial Reasoning About Motorway Traffic Safety with Isabelle/HOL (SL), pp. 34–49.
IFM-2017-OweRF #contract #hoare #multi: Hoare-Style Reasoning from Multiple Contracts (OO, TR, EF), pp. 263–278.
SEFM-2017-NguyenSGM #evolution #modelling #requirements: Modeling and Reasoning on Requirements Evolution with Constrained Goal Models (CMN, RS, PG, JM), pp. 70–86.
Haskell-2017-BraquehaisR #black box #equation #named: Speculate: discovering conditional equations and inequalities about black-box functions by reasoning from test results (RB, CR), pp. 40–51.
CIKM-2017-Jatowt0 #documentation #interactive: Interactive System for Reasoning about Document Age (AJ, RC0), pp. 2471–2474.
ICML-2017-TrivediDWS #graph #named: Know-Evolve: Deep Temporal Reasoning for Dynamic Knowledge Graphs (RT, HD, YW0, LS), pp. 3462–3471.
MoDELS-2017-FamelisRCSC #design #nondeterminism #product line #variability: Software Product Lines with Design Choices: Reasoning about Variability and Design Uncertainty (MF, JR, KC, RS, MC), pp. 93–100.
ECOOP-2017-KaiserDDLV #consistency #logic #memory management: Strong Logic for Weak Memory: Reasoning About Release-Acquire Consistency in Iris (JOK, HHD, DD, OL, VV), p. 29.
OOPSLA-2017-AnconaDZ #axiom: Reasoning on divergent computations with coaxioms (DA, FD, EZ), p. 26.
OOPSLA-2017-MadsenLT #javascript: A model for reasoning about JavaScript promises (MM, OL, FT), p. 24.
OOPSLA-2017-PadonLSS #decidability #distributed #protocol: Paxos made EPR: decidable reasoning about distributed protocols (OP, GL, MS, SS), p. 31.
POPL-2017-KovacsRV #quantifier: Coming to terms with quantified reasoning (LK, SR, AV), pp. 260–270.
ASE-2017-CoppaDD #execution #pointer #symbolic computation: Rethinking pointer reasoning in symbolic execution (EC, DCD, CD), pp. 613–618.
ESEC-FSE-2017-ErataGTK #automation #configuration management #semantics: A tool for automated reasoning about traces based on configurable formal semantics (FE, AG, BT, GK), pp. 959–963.
ESOP-2017-CrubilleL #metric: Metric Reasoning About λ-Terms: The General Case (RC, UDL), pp. 341–367.
ESOP-2017-JansenKMNZ #logic #robust: Unified Reasoning About Robustness Properties of Symbolic-Heap Separation Logic (CJ, JK, CM, TN0, FZ), pp. 611–638.
CADE-2017-Andronick #concurrent: Reasoning About Concurrency in High-Assurance, High-Performance Software Systems (JA), pp. 1–7.
CAV-2017-FanQM0 #composition #data-driven #named #verification: DryVR: Data-Driven Verification and Compositional Reasoning for Automotive Systems (CF, BQ, SM, MV0), pp. 441–461.
CAV-2017-ConchonIJMF #float #smt: A Three-Tier Strategy for Reasoning About Floating-Point Numbers in SMT (SC, MI, KJ, GM, CF), pp. 419–435.
CSL-2017-BresolinMS #logic #performance: Fast(er) Reasoning in Interval Temporal Logic (DB, EMV, GS), p. 17.
VMCAI-2017-ReynoldsIS #logic: Reasoning in the Bernays-Schönfinkel-Ramsey Fragment of Separation Logic (AR, RI, CS), pp. 462–482.
CBSE-2016-KjaergaardJSH #framework #named #platform: OccuRE: An Occupancy REasoning Platform for Occupancy-Driven Applications (MBK, AJ, FCS, EH), pp. 39–48.
ECSA-2016-SchriekWTB #architecture #design #game studies: Software Architecture Design Reasoning: A Card Game to Help Novice Designers (CS, JMEMvdW, AT, FB), pp. 22–38.
EDM-2016-Kyrilov #automation #feedback #programming #using: Using Case-Based Reasoning to Automatically Generate High-Quality Feedback for Programming Exercises (AK), pp. 669–671.
FSCD-2016-ArieliA #consistency #logic #nondeterminism: Minimal Paradefinite Logics for Reasoning with Incompleteness and Inconsistency (OA, AA), p. 15.
IFM-2016-Kovacs #automation #program analysis #symbolic computation: Symbolic Computation and Automated Reasoning for Program Analysis (LK), pp. 20–27.
IFM-2016-Owe #concurrent #inheritance #object-oriented #reuse #strict: Reasoning About Inheritance and Unrestricted Reuse in Object-Oriented Concurrent Systems (OO), pp. 210–225.
ICFP-2016-CastroHS #morphism #parallel #pipes and filters #process #using: Farms, pipes, streams and reforestation: reasoning about structured parallel processes using types and hylomorphisms (DC, KH, SS), pp. 4–17.
OOPSLA-2016-PanchekhaT #automation #layout #web: Automated reasoning for web page layout (PP, ET), pp. 181–194.
POPL-2016-GotsmanYFNS #consistency #distributed: 'Cause I'm strong enough: reasoning about consistency choices in distributed systems (AG, HY, CF0, MN, MS0), pp. 371–384.
FSE-2016-Omoronyia #privacy: Reasoning with imprecise privacy preferences (IO), pp. 952–955.
CASE-2016-RehbergerSV #approach #automation #flexibility: An agent approach to flexible automated production systems based on discrete and continuous reasoning (SR, LS, BVH), pp. 1249–1256.
ESOP-2016-KaminskiKMO #probability #source code: Weakest Precondition Reasoning for Expected Run-Times of Probabilistic Programs (BLK, JPK, CM, FO), pp. 364–389.
CAV-2016-ElkaderGPS #automation #composition #refinement: Automated Circular Assume-Guarantee Reasoning with N-way Decomposition and Alphabet Refinement (KAE, OG, CSP, SS), pp. 329–351.
CAV-2016-TrinhCJ #recursion #string: Progressive Reasoning over Recursively-Defined Strings (MTT, DHC, JJ), pp. 218–240.
VMCAI-2016-0001SS #framework #named #verification: Viper: A Verification Infrastructure for Permission-Based Reasoning (PM0, MS, AJS), pp. 41–62.
ECSA-2015-AbbasA #adaptation #architecture #case study #product line #self: Architectural Reasoning Support for Product-Lines of Self-adaptive Software Systems — A Case Study (NA, JA), pp. 20–36.
SIGMOD-2015-ChristensenWLYT #named #online #scalability: STORM: Spatio-Temporal Online Reasoning and Management of Large Spatio-Temporal Data (RC, LW, FL, KY, JT, NV), pp. 1111–1116.
EDM-2015-MallavarapuLSSZ #simulation: Developing Computational Methods to Measure and Track Learners' Spatial Reasoning in an Open-Ended Simulation (AM, LL, TS, BS, MZ, EM), p. 23.
ICALP-v2-2015-LahavV #memory management #modelling: Owicki-Gries Reasoning for Weak Memory Models (OL, VV), pp. 311–323.
LATA-2015-Peltier #approach: Reasoning on Schemas of Formulas: An Automata-Based Approach (NP), pp. 263–274.
FM-2015-BringerCML #architecture #design #privacy: Privacy by Design in Practice: Reasoning about Privacy Properties of Biometric System Architectures (JB, HC, DLM, RL), pp. 90–107.
FM-2015-ElkaderGPS #automation: Automated Circular Assume-Guarantee Reasoning (KAE, OG, CSP, SS), pp. 23–39.
FM-2015-SharmaWCHC #infinity: Certified Reasoning with Infinity (AS, SW, AC, AH, WNC), pp. 496–513.
RTA-2015-EndrullisHHP0 #equation #framework #induction: A Coinductive Framework for Infinitary Rewriting and Equational Reasoning (JE, HHH, DH, AP, AS), pp. 143–159.
SEFM-2015-JonesY #abstraction #using: Reasoning about Separation Using Abstraction and Reification (CBJ, NY), pp. 3–19.
Haskell-2015-FarmerSG #equation #haskell #source code #tool support: Reasoning with the HERMIT: tool support for equational reasoning on GHC core programs (AF, NS, AG), pp. 23–34.
CHI-PLAY-2015-CulpMS #game studies: Extending the Impact of Digital Games by Supporting Analogical Reasoning (KMC, WM, MS), pp. 487–492.
CHI-PLAY-2015-DiazDHS #multi #online: Scientific Heroes: Multiplayer Online Battle Arenas Foster Players' Hypothetico-Deductive Reasoning (CMCD, BD, HH, JWS), pp. 481–485.
ICGT-2015-KissingerZ #diagrams #equation #product line #string: Equational Reasoning with Context-Free Families of String Diagrams (AK, VZ), pp. 138–154.
CHI-2015-EslamiRVAVKHS #algorithm #quote: “I always assumed that I wasn’t really that close to [her]”: Reasoning about Invisible Algorithms in News Feeds (ME, AR, KV, AA, AV, KK, KH, CS), pp. 153–162.
DHM-EH-2015-SinghWLMW #formal method #modelling #requirements: Stepwise Formal Modelling and Reasoning of Insulin Infusion Pump Requirements (NKS, HW, ML, TSEM, AW), pp. 387–398.
ICEIS-v1-2015-JuniorS #approach #compilation #optimisation #set: Finding Good Compiler Optimization Sets — A Case-based Reasoning Approach (NLQJ, AFdS), pp. 504–515.
CIKM-2015-NuttPS #implementation #query: Implementing Query Completeness Reasoning (WN, SP0, OS), pp. 733–742.
SEKE-2015-SubramanianKKG: Quantitative Reasoning of Goal Satisfaction in the i*Framework (CS, AK, AK, RPG), pp. 666–669.
MoDELS-J-2011-JacksonLB15 #automation #metamodelling: Automatically reasoning about metamodeling (EKJ, TL, DB), pp. 271–285.
ECMFA-J-2012-ButtnerC15 #lightweight #string: Lightweight string reasoning in model finding (FB, JC), pp. 413–427.
SPLC-2015-TeixeiraABG #evolution #product line: A product line of theories for reasoning about safe evolution of product lines (LT, VA, PB, RG), pp. 161–170.
OOPSLA-2015-NtzikG #file system: Reasoning about the POSIX file system: local update and global pathnames (GN, PG), pp. 201–220.
PLDI-2015-EmmiEH #monitoring #refinement: Monitoring refinement via symbolic reasoning (ME, CE, JH), pp. 260–269.
POPL-2015-HeGWZ #automaton #composition #concurrent #probability: Leveraging Weighted Automata in Compositional Reasoning about Concurrent Probabilistic Systems (FH, XG, BYW, LZ), pp. 503–514.
POPL-2015-JungSSSTBD #concurrent #invariant #monad #named #orthogonal: Iris: Monoids and Invariants as an Orthogonal Basis for Concurrent Reasoning (RJ, DS, FS, KS, AT, LB, DD), pp. 637–650.
REFSQ-2015-GharibG #modelling #quality #requirements: Modeling and Reasoning About Information Quality Requirements (MG, PG), pp. 49–64.
SAC-2015-BorgesDSEAS #approach #performance #reuse #using: Efficient approach for reusing and sharing train driving plans using case-based reasoning (APB, OBD, DMVS, FE, BCÁ, EES), pp. 505–508.
SAC-2015-SioutisSC #composition #graph #on the: On the use and effect of graph decomposition in qualitative spatial and temporal reasoning (MS, YS, JFC), pp. 1874–1879.
DATE-2015-JiaoMD #synthesis: Knowledge-intensive, causal reasoning for analog circuit topology synthesis in emergent and innovative applications (FJ, SM, AD), pp. 1144–1149.
ESOP-2015-DavidKL15a #safety #source code #termination: Propositional Reasoning about Safety and Termination of Heap-Manipulating Programs (CD, DK, ML), pp. 661–684.
FASE-2015-DaniaC #modelling: Model-Based Formal Reasoning about Data-Management Applications (CD, MC), pp. 218–232.
FoSSaCS-2015-CloustonBGB #induction #programming #recursion: Programming and Reasoning with Guarded Recursion for Coinductive Types (RC, AB, HBG, LB), pp. 407–421.
FoSSaCS-2015-GeblerLT #calculus #composition #metric #probability #process: Compositional Metric Reasoning with Probabilistic Process Calculi (DG, KGL, ST), pp. 230–245.
CADE-2015-FurbachPS #automation: Automated Reasoning in the Wild (UF, BP, CS), pp. 55–72.
CADE-2015-KissingerZ #diagrams #named #proving: Quantomatic: A Proof Assistant for Diagrammatic Reasoning (AK, VZ), pp. 326–336.
CAV-2015-HawblitzelPQT #automation #composition #concurrent #refinement #source code: Automated and Modular Refinement Reasoning for Concurrent Programs (CH, EP, SQ, ST), pp. 449–465.
ICLP-2015-BrocheninM #set: Abstract Answer Set Solvers for Cautious Reasoning (RB, MM), pp. 179–190.
ICLP-2015-LeeWZ #automation #programming #set #using: Automated Reasoning about XACML 3.0 Delegation Using Answer Set Programming (JL, YW, YZ), pp. 247–259.
LICS-2015-CrubilleL #metric: Metric Reasoning about ?-Terms: The Affine Case (RC, UDL), pp. 633–644.
SAT-2015-TuHJ #learning #named #satisfiability: QELL: QBF Reasoning with Extended Clause Learning and Levelized SAT Solving (KHT, TCH, JHRJ), pp. 343–359.
JCDL-2014-KargakisT #automation #information management #named: Epimenides: An information system offering automated reasoning for the needs of digital preservation (YK, YT), pp. 411–412.
PODS-2014-KolaitisPSS #dependence: Nested dependencies: structure and reasoning (PGK, RP, ES, VS), pp. 176–187.
FM-2014-MitschQP #hybrid #logic #refactoring #refinement: Refactoring, Refinement, and Reasoning — A Logical Characterization for Hybrid Systems (SM, JDQ, AP), pp. 481–496.
SEFM-2014-KeshishzadehM #consistency #domain-specific language #formal method #semantics #testing: Formalizing DSL Semantics for Reasoning and Conformance Testing (SK, AJM), pp. 81–95.
ICGT-2014-LambersO #graph: Tableau-Based Reasoning for Graph Properties (LL, FO), pp. 17–32.
HCI-AIMT-2014-TawatsujiMM #towards: Proposal for the Model of Occurrence of Negative Response toward Humanlike Agent Based on Brain Function by Qualitative Reasoning (YT, KM, TM), pp. 768–778.
LCT-TRE-2014-LambropoulosB #case study #evolution #experience #weaving: Weaving User Immersive Experiences: Scientific Curiosity and Reasoning with Bodily Feelings Mapping and Evolution (NL, TB), pp. 62–71.
CAiSE-2014-ChatzikonstantinouAK #specification: Task Specification and Reasoning in Dynamically Altered Contexts (GC, MA, KK), pp. 625–639.
ICEIS-v1-2014-KannistoHPK #architecture #assessment #distributed #information management #mobile #performance #rule-based: Distributed Knowledge Management Architecture and Rule Based Reasoning for Mobile Machine Operator Performance Assessment (PK, DH, LP, SK), pp. 440–449.
KEOD-2014-SurynekS #big data #challenge #graph #information management #logic #perspective: Theoretical Challenges in Knowledge Discovery in Big Data — A Logic Reasoning and a Graph Theoretical Point of View (PS, PS), pp. 327–332.
KR-2014-BenferhatT #network #nondeterminism: Reasoning with Uncertain Inputs in Possibilistic Networks (SB, KT).
KR-2014-EwinPV #calculus: Transforming Situation Calculus Action Theories for Optimised Reasoning (CJE, ARP, SV).
KR-2014-GarciaLS #finite #logic: Finite Model Reasoning in Horn Description Logics (YAIG, CL, TS).
KR-2014-GutierrezHW #concurrent: Reasoning about Equilibria in Game-Like Concurrent Systems (JG, PH, MW).
KR-2014-HaanS #complexity #problem: The Parameterized Complexity of Reasoning Problems Beyond NP (RdH, SS).
KR-2014-LakemeyerL #calculus #decidability: Decidable Reasoning in a Fragment of the Epistemic Situation Calculus (GL, HJL).
KR-2014-Morgenstern #concept #representation: Representing and Reasoning about Time Travel Narratives: Foundational Concepts (LM).
KR-2014-ParentT: Aggregative Deontic Detachment for Normative Reasoning (XP, LvdT).
KR-2014-PereiraDH #abduction #approach #bias: An Abductive Reasoning Approach to the Belief Bias Effect (LMP, EAD, SH).
KR-2014-ZhangR #algebra #representation: Qualitative Spatial Representation and Reasoning in Angry Birds: The Extended Rectangle Algebra (PZ, JR).
SEKE-2014-HartmannFNMKT #approach #modelling #runtime #using: Reasoning at Runtime using time-distorted Contexts: A Models@run.time based Approach (TH, FF, GN, BM, JK, YLT), pp. 586–591.
SEKE-2014-MachadoSFC #collaboration #risk management: Case-based Reasoning for Experience-based Collaborative Risk Management (NLRM, LAdLS, LMF, JAC), pp. 262–267.
SEKE-2014-XuL14a #ontology #semantics #using: Two-Level Smart Search Engine Using Ontology-Based Semantic Reasoning (HX, AL), pp. 648–652.
POPL-2014-Birkedal #composition #concurrent #higher-order #imperative #source code: Modular reasoning about concurrent higher-order imperative programs (LB), pp. 1–2.
POPL-2014-ChongDK #abstraction #parallel: A sound and complete abstraction for reasoning about parallel prefix sums (NC, AFD, JK), pp. 397–410.
POPL-2014-ItzhakyBILNS #composition #effectiveness: Modular reasoning about heap paths via effectively propositional formulas (SI, AB, NI, OL, AN, MS), pp. 385–396.
RE-2014-IngolfoSM #requirements: Nòmos 3: Reasoning about regulatory compliance of requirements (SI, AS, JM), pp. 313–314.
RE-2014-LiuSYM14a #feature model #requirements: Combined goal and feature model reasoning with the User Requirements Notation and jUCMNav (YL, YS, XY, GM), pp. 321–322.
RE-2014-QianPCMWZ #adaptation #self: Rationalism with a dose of empiricism: Case-based reasoning for requirements-driven self-adaptation (WQ, XP, BC, JM, HW, WZ), pp. 113–122.
ICSE-2014-HeWYZ #learning: Symbolic assume-guarantee reasoning through BDD learning (FH, BYW, LY, LZ), pp. 1071–1082.
DATE-2014-LeeserMRW #effectiveness #float: Make it real: Effective floating-point reasoning via exact arithmetic (ML, SM, JR, TW), pp. 1–4.
ESOP-2014-GardnerNW #file system: Local Reasoning for the POSIX File System (PG, GN, AW), pp. 169–188.
FASE-2014-BaierDKDKMW #model checking #multi #probability #standard: Probabilistic Model Checking and Non-standard Multi-objective Reasoning (CB, CD, SK, MD, JK, SM, SW), pp. 1–16.
TACAS-2014-HuthK #automation #named #trust: PEALT: An Automated Reasoning Tool for Numerical Aggregation of Trust Evidence (MH, JHPK), pp. 109–123.
ICLP-J-2014-PereiraDH #abduction: Contextual Abductive Reasoning with Side-Effects (LMP, EAD, SH), pp. 633–648.
ICLP-J-2014-SaadFG #constraints #reliability: The P-Box CDF-Intervals: A Reliable Constraint Reasoning with Quantifiable Information (AS, TWF, CG), pp. 461–475.
ICLP-J-2014-Swift #incremental #information management #representation: Incremental Tabling in Support of Knowledge Representation and Reasoning (TS), pp. 553–567.
LICS-CSL-2014-KoskinenT: Local temporal reasoning (EK, TT), p. 10.
SMT-2014-LamC #set: Reasoning About Set Comprehensions (ESLL, IC), pp. 27–37.
PODS-2013-HernichKLG #datalog #ontology #semantics: Well-founded semantics for extended datalog and ontological reasoning (AH, CK, TL, GG), pp. 225–236.
CSEET-2013-CookDSSCH #ide #specification #using #web: Specification and reasoning in SE projects using a Web IDE (CTC, SDS, YSS, MS, JCC, JEH), pp. 229–238.
ICALP-v2-2013-AlmagorBK #formal method #quality: Formalizing and Reasoning about Quality (SA, UB, OK), pp. 15–27.
IFM-2013-LucanuR #equivalence: Program Equivalence by Circular Reasoning (DL, VR), pp. 362–377.
SEFM-2013-BennaceurCIJ #automation #behaviour #ontology #synthesis: Automated Mediator Synthesis: Combining Behavioural and Ontological Reasoning (AB, CC, MI, BJ), pp. 274–288.
ICFP-2013-Brady #algebra #dependent type #programming: Programming and reasoning with algebraic effects and dependent types (EB), pp. 133–144.
ICFP-2013-DelbiancoN #algebra #continuation #hoare: Hoare-style reasoning with (algebraic) continuations (GAD, AN), pp. 363–376.
ICFP-2013-TuronDB #concurrent #higher-order #hoare #logic #refinement: Unifying refinement and hoare-style reasoning in a logic for higher-order concurrency (AT, DD, LB), pp. 377–390.
AIIDE-2013-LeeceJ #game studies #learning: Reinforcement Learning for Spatial Reasoning in Strategy Games (MAL, AJ).
DiGRA-2013-JacobZM #gesture #representation: Viewpoints AI: Procedurally Representing and Reasoning about Gestures (MJ, AZ, BM).
HCI-III-2013-Joo #behaviour #simulation: Perception and BDI Reasoning Based Agent Model for Human Behavior Simulation in Complex System (JJ), pp. 62–71.
EDOC-2013-GoknilKM #approach #metamodelling #modelling #multi #requirements: A metamodeling approach for reasoning on multiple requirements models (AG, IK, JVM), pp. 159–166.
ICEIS-J-2013-YaguinumaMSCR13a #fuzzy #ontology: Combining Fuzzy Ontology Reasoning and Mamdani Fuzzy Inference System with HyFOM Reasoner (CAY, WCPMJ, MTPS, HAC, MR), pp. 174–189.
ICEIS-v1-2013-YaguinumaMSCR #fuzzy #hybrid #integration #ontology: HyFOM Reasoner: Hybrid Integration of Fuzzy Ontology and Mamdani Reasoning (CAY, WCPMJ, MTPS, HAC, MR), pp. 370–378.
KDD-2013-SongZSHUS #modelling #probability #scalability: Modeling and probabilistic reasoning of population evacuation during large-scale disaster (XS, QZ, YS, TH, SU, RS), pp. 1231–1239.
KEOD-2013-AlirezaieL #abduction #automation #data type #using: Automatic Annotation of Sensor Data Streams using Abductive Reasoning (MA, AL), pp. 345–354.
KEOD-2013-ChabaneR #image #ontology #retrieval #semantics: Semantic Gastroenterological Images Annotation and Retrieval — Reasoning with a Polyp Ontology (YC, CR), pp. 293–300.
KEOD-2013-Marc-ZweckerBZB #owl: Qualitative Spatial Reasoning in RCC8 with OWL and SWRL (SMZ, FdBdB, CZM, FLB), pp. 214–221.
KEOD-2013-ZouhaierDA #automation #generative #using: Automatic Generation of UIs for Disabled Users using Context-aware Techniques and Reasoning (LZ, YBH, LJBA), pp. 413–418.
Onward-2013-ValleeWZFK #modelling #problem #security: Usable security as a static-analysis problem: modeling and reasoning about user permissions in social-sharing systems (HQdlV, JMW, WZ, KF, SK), pp. 1–16.
PLDI-2013-CookK #nondeterminism #source code: Reasoning about nondeterminism in programs (BC, EK), pp. 219–230.
POPL-2013-Dinsdale-YoungBGPY #composition #concurrent #named #source code: Views: compositional reasoning for concurrent programs (TDY, LB, PG, MJP, HY), pp. 287–300.
POPL-2013-GordonABCGNRR: A model-learner pattern for bayesian reasoning (ADG, MA, JB, GC, TG, AVN, SKR, CVR), pp. 403–416.
PPDP-2013-WangCGN #higher-order #relational #specification: Reasoning about higher-order relational specifications (YW, KC, AG, GN), pp. 157–168.
ASE-2013-Ganai #incremental #performance #predict: Efficient data race prediction with incremental reasoning on time-stamped lock history (MKG), pp. 37–47.
ESEC-FSE-2013-PhamW #abstraction #algebra #data type #named: RADA: a tool for reasoning about algebraic data types with abstractions (THP, MWW), pp. 611–614.
ICSE-2013-Oster #component: Reasoning with qualitative preferences to develop optimal component-based systems (ZJO), pp. 1456–1458.
SAC-2013-StevensonYDPMV #network #resource management #self #semantics: Combining self-organisation, context-awareness and semantic reasoning: the case of resource discovery in opportunistic networks (GS, JY, SD, DP, SM, MV), pp. 1369–1376.
CASE-2013-JeongMS #approximate #assessment #design #lifecycle #using: Approximate life cycle assessment using case-based reasoning for the eco design of products (MGJ, JRM, HWS), pp. 486–491.
ESOP-2013-JagadeesanPPR #composition #memory management #modelling: Quarantining Weakness — Compositional Reasoning under Relaxed Memory Models (RJ, GP, CP, JR), pp. 492–511.
ESOP-2013-SvendsenBP #composition #concurrent #data type: Modular Reasoning about Separation of Concurrent Data Structures (KS, LB, MJP), pp. 169–188.
CADE-2013-KaminskiT #incremental #named #reduction #satisfiability: InKreSAT: Modal Reasoning via Incremental Reduction to SAT (MK, TT), pp. 436–442.
CADE-2013-Shankar #automation #performance: Automated Reasoning, Fast and Slow (NS), pp. 145–161.
CADE-2013-Sofronie-Stokkermans #generative #hybrid #parametricity #verification: Hierarchical Reasoning and Model Generation for the Verification of Parametric Hybrid Systems (VSS), pp. 360–376.
CAV-2013-HaaseIOP #graph #logic #named: SeLoger: A Tool for Graph-Based Reasoning in Separation Logic (CH, SI, JO, MJP), pp. 790–795.
CAV-2013-ItzhakyBINS #data type #effectiveness #linked data #open data #reachability: Effectively-Propositional Reasoning about Reachability in Linked Data Structures (SI, AB, NI, AN, MS), pp. 756–772.
ICLP-J-2013-SneyersSF #probability: Probabilistic legal reasoning in CHRiSM (JS, DDS, TWF), pp. 769–781.
LICS-2013-DemriFP: Reasoning about Data Repetitions with Counter Systems (SD, DF, MP), pp. 33–42.
LICS-2013-HoffmannMS #proving: Quantitative Reasoning for Proving Lock-Freedom (JH, MM, ZS), pp. 124–133.
IFM-2012-DongolH #multi #source code: Rely/Guarantee Reasoning for Teleo-reactive Programs over Multiple Time Bands (BD, IJH), pp. 39–53.
SEFM-2012-DinDO #composition: Compositional Reasoning about Shared Futures (CCD, JD, OO), pp. 94–108.
CSCW-2012-LungE #collaboration #graph #named: Inflo: collaborative reasoning via open calculation graphs (JL, SME), pp. 1199–1202.
CAiSE-2012-ErnstBMJ #agile #evolution #requirements: Agile Requirements Evolution via Paraconsistent Reasoning (NAE, AB, JM, IJ), pp. 382–397.
KEOD-2012-RiegenHR #ontology: Combining Qualitative Spatial Reasoning and Ontological Reasoning for Supporting Robot Tasks (SvR, LH, PR), pp. 377–380.
KR-2012-BaralL #declarative #representation: From Knowledge Represented in Frame-Based Languages to Declarative Representation and Reasoning via ASP (CB, SL).
KR-2012-ChaudhriS #knowledge base #programming #set #specification #using: Specifying and Reasoning with Underspecified Knowledge Bases Using Answer Set Programming (VKC, TCS).
KR-2012-Feier #logic programming #source code #worst-case: Worst-Case Optimal Reasoning with Forest Logic Programs (CF).
KR-2012-GebserGKOSS #programming #set: Stream Reasoning with Answer Set Programming: Preliminary Report (MG, TG, RK, PO, OS, TS).
KR-2012-Huang: Compactness and Its Implications for Qualitative Spatial and Temporal Reasoning (JH).
KR-2012-KazakovKS #logic #product line: Practical Reasoning with Nominals in the EL Family of Description Logics (YK, MK, FS).
KR-2012-Renz #constraints: Implicit Constraints for Qualitative Spatial and Temporal Reasoning (JR).
KR-2012-TachmazidisAFK #parallel #towards: Towards Parallel Nonmonotonic Reasoning with Billions of Facts (IT, GA, GF, SK).
ECMFA-2012-ButtnerC #lightweight #ocl #string: Lightweight String Reasoning for OCL (FB, JC), pp. 244–258.
AdaEurope-2012-Iliasov #case study #development: Augmenting Formal Development with Use Case Reasoning (AI), pp. 133–146.
LOPSTR-2012-Zinn #program analysis: Program Analysis and Manipulation to Reproduce Learners’ Erroneous Reasoning (CZ), pp. 228–243.
POPL-2012-BartheKOB #difference #privacy #probability #relational: Probabilistic relational reasoning for differential privacy (GB, BK, FO, SZB), pp. 97–110.
POPL-2012-FarzanK #composition #concurrent #source code #verification: Verification of parameterized concurrent programs by modular reasoning about data and control (AF, ZK), pp. 297–308.
RE-2012-VrbaskiPA #rule-based #tool support: Tool support for combined rule-based and goal-based reasoning in Context-Aware systems (MV, DCP, DA), pp. 335–336.
REFSQ-2012-DaramolaMSB #perspective #requirements #research #semantics #using: Managing Implicit Requirements Using Semantic Case-Based Reasoning Research Preview (OD, TM, GS, SB), pp. 172–178.
ICSE-2012-FamelisSC #modelling #nondeterminism #towards: Partial models: Towards modeling and reasoning with uncertainty (MF, RS, MC), pp. 573–583.
GPCE-2012-RysselPK #feature model #modelling: Reasoning of feature models from derived features (UR, JP, KK), pp. 21–30.
DAC-2012-Rinard: Obtaining and reasoning about good enough software (MCR), pp. 930–935.
ESOP-2012-HawkinsAFRS: Reasoning about Lock Placements (PH, AA, KF, MCR, MS), pp. 336–356.
ESOP-2012-InoueT #multi #source code: Reasoning about Multi-stage Programs (JI, WT), pp. 357–376.
FoSSaCS-2012-BoveDS #automation #first-order #functional #interactive #source code: Combining Interactive and Automatic Reasoning in First Order Theories of Functional Programs (AB, PD, ASR), pp. 104–118.
IJCAR-2012-GoreT #automation #logic: BDD-Based Automated Reasoning for Propositional Bi-Intuitionistic Tense Logics (RG, JT), pp. 301–315.
IJCAR-2012-Matiyasevich #automation: Enlarging the Scope of Applicability of Successful Techniques for Automated Reasoning in Mathematics (YM), p. 9.
SMT-2012-DrossCKP: Reasoning with Triggers (CD, SC, JK, AP), pp. 22–31.
VMCAI-2012-BouajjaniDES #abstract domain #automation #infinity #source code: Abstract Domains for Automated Reasoning about List-Manipulating Programs with Infinite Data (AB, CD, CE, MS), pp. 1–22.
WICSA-2011-HeeschA #architecture #maturity #overview #process: Mature Architecting — A Survey about the Reasoning Process of Professional Architects (UvH, PA), pp. 260–269.
WICSA-2011-TekinerdoganOD #architecture #as a service #design #modelling: Modeling and Reasoning about Design Alternatives of Software as a Service Architectures (BT, KÖ, AHD), pp. 312–319.
SCAM-J-2009-ShubatiDD11 #generative: Artefact generation in second life with case-based reasoning (AS, CWD, RD), pp. 431–446.
ICPC-2011-BurrowsTGF #aspect-oriented #evaluation #fault #source code: Reasoning about Faults in Aspect-Oriented Programs: A Metrics-Based Evaluation (RB, FT, AG, FCF), pp. 131–140.
SCAM-2011-CooganD #assembly #equation: Equational Reasoning on x86 Assembly Code (KC, SKD), pp. 75–84.
WCRE-2011-KellensRNSJ #evolution #quantifier #source code #using: Reasoning over the Evolution of Source Code Using Quantified Regular Path Expressions (AK, CDR, CN, RS, VJ), pp. 389–393.
IFM-J-2009-DovlandJOS11 #behaviour #incremental #inheritance #lazy evaluation #multi #type system: Incremental reasoning with lazy behavioral subtyping for multiple inheritance (JD, EBJ, OO, MS), pp. 915–941.
FM-2011-GhaziT #relational #smt: Relational Reasoning via SMT Solving (AAEG, MT), pp. 133–148.
CEFP-2011-Butterfield #functional #source code: Reasoning about I/O in Functional Programs (AB), pp. 93–141.
CEFP-2011-MichaelsonG #calculus #multi: Reasoning about Multi-process Systems with the Box Calculus (GM, GG), pp. 279–338.
ICFP-2011-GibbonsH #equation #monad: Just do it: simple monadic equational reasoning (JG, RH), pp. 2–14.
DiGRA-2011-Togelius: A Procedural Critique of Deontological Reasoning (JT).
AGTIVE-2011-Strecker #graph transformation #locality: Locality in Reasoning about Graph Transformations (MS), pp. 169–181.
ICEIS-v2-2011-VaginE: Reasoning in Intelligent Diagnosis Systems (VNV, APE), pp. 18–25.
CIKM-2011-MeiserDT #interactive #knowledge base #nondeterminism #rdf: Interactive reasoning in uncertain RDF knowledge bases (TM, MD, MT), pp. 2557–2560.
CIKM-2011-RenP #maintenance #ontology #optimisation: Optimising ontology stream reasoning with truth maintenance system (YR, JZP), pp. 831–836.
KDIR-2011-KuhlweinUTGH #automation #multi #ranking: Multi-output Ranking for Automated Reasoning (DK, JU, ET, HG, TH), pp. 42–51.
KEOD-2011-BaumgartnerGMRS #data type: Reasoning on Data Streams for Situation Awareness (NB, WG, SM, WR, WS), pp. 407–412.
KEOD-2011-PhamS: Practical Goal-based Reasoning in Ontology-driven Applications (HP, DS), pp. 99–109.
KEOD-2011-StratosSG #logic: Episodic Logic: Natural Logic + Reasoning (KS, LKS, JG), pp. 304–310.
KMIS-2011-Chebel-MorelloHZ #adaptation #modelling #using: Adaptation based on Knowledge Models for Diagnostic Systems using Case-base Reasoning (BCM, MKH, NZ), pp. 223–229.
MoDELS-2011-JacksonLB #automation #metamodelling #proving #specification: Reasoning about Metamodeling with Formal Specifications and Automatic Proofs (EKJ, TL, DB), pp. 653–667.
Onward-2011-Bierhoff #automation #lightweight #verification: Automated program verification made SYMPLAR: symbolic permissions for lightweight automated reasoning (KB), pp. 19–32.
POPL-2011-DilligDA #precise #source code #using: Precise reasoning for programs using containers (ID, TD, AA), pp. 187–200.
POPL-2011-DoddsJP #composition #parallel: Modular reasoning for deterministic parallelism (MD, SJ, MJP), pp. 259–270.
RE-2011-WeiYJZ #automation #modelling #named #non-functional: rΣ: Automated reasoning tool for non-functional requirement goal models (BW, BY, ZJ, DZ), pp. 337–338.
ESEC-FSE-2011-InostrozaTB #aspect-oriented #composition #interface #source code: Join point interfaces for modular reasoning in aspect-oriented programs (MI, ÉT, EB), pp. 508–511.
SAC-2011-BouidghaghenTB #approach #mobile: Inferring situation-based interests for mobile users: a case based reasoning approach (OB, LT, MB), pp. 1166–1167.
SAC-2011-ZhangYMC #information management #ontology #representation #xml: Knowledge representation and reasoning of XML with ontology (FZ, LY, ZMM, JC), pp. 1705–1710.
CASE-2011-MikosFG #agile #approach #distributed #injection #process: A distributed system for rapid determination of nonconformance causes and solutions for the thermoplastic injection molding process: A Case-Based Reasoning Agents approach (WLM, JCEF, FGCG), pp. 755–760.
DATE-2011-PavlenkoWSKDSG #algebra #named #problem #smt #verification: STABLE: A new QF-BV SMT solver for hard verification problems combining Boolean reasoning with computer algebra (EP, MW, DS, WK, AD, FS, GMG), pp. 155–160.
PPoPP-2011-YiSF #execution: Cooperative reasoning for preemptive execution (JY, CS, CF), pp. 147–156.
FASE-2011-FengKP #automation #composition #learning #probability: Automated Learning of Probabilistic Assumptions for Compositional Reasoning (LF, MZK, DP), pp. 2–17.
CADE-2011-Claessen #automation #first-order #logic: The Anatomy of Equinox — An Extensible Automated Reasoning Tool for First-Order Logic and Beyond — (KC), pp. 1–3.
CADE-2011-HaarslevSV #automation #smt: Automated Reasoning in 𝒜ℒ𝒞𝒬 via SMT (VH, RS, MV), pp. 283–298.
CADE-2011-HoderV #scalability: Sine Qua Non for Large Theory Reasoning (KH, AV), pp. 299–314.
CADE-2011-SchneiderS #automation #first-order #ontology #owl #proving #theorem proving #using: Reasoning in the OWL 2 Full Ontology Language Using First-Order Automated Theorem Proving (MS, GS), pp. 461–475.
CSL-2011-SchwinghammerB #nondeterminism #relational: Step-Indexed Relational Reasoning for Countable Nondeterminism (JS, LB), pp. 512–524.
ICLP-2011-Kriener #logic programming #source code: Correct Reasoning about Logic Programs (JK), pp. 280–283.
ICLP-2011-MaRBL #abduction #multi: Multi-agent Confidential Abductive Reasoning (JM, AR, KB, EL), pp. 175–186.
ICLP-2011-Zombori #information retrieval #logic #performance: Two Phase Description Logic Reasoning for Efficient Information Retrieval (ZZ), pp. 296–300.
ICLP-J-2011-RiguzziS #nondeterminism: The PITA system: Tabling and answer subsumption for reasoning under uncertainty (FR, TS), pp. 433–449.
VMCAI-2011-JacobsK #axiom #specification #towards: Towards Complete Reasoning about Axiomatic Specifications (SJ, VK), pp. 278–293.
ECSA-2010-HeeschA #architecture #comprehension #overview #process #student: Naive Architecting — Understanding the Reasoning Process of Students — A Descriptive Survey (UvH, PA), pp. 24–37.
LATA-2010-Penaloza #standard #using: Using Sums-of-Products for Non-standard Reasoning (RP), pp. 488–499.
IFM-2010-Faber #architecture #composition #realtime #verification: Verification Architectures: Compositional Reasoning for Real-Time Systems (JF), pp. 136–151.
ICFP-2010-DreyerNB #higher-order #relational: The impact of higher-order state and control effects on local relational reasoning (DD, GN, LB), pp. 143–156.
CAiSE-2010-ChopraDGM #modelling: Modeling and Reasoning about Service-Oriented Applications via Goals and Commitments (AKC, FD, PG, JM), pp. 113–128.
ICEIS-DISI-2010-Chein #graph #information management #representation: Graph-based Knowledge Representation and Reasoning (MC), pp. 17–21.
ICEIS-DISI-2010-SantosC #information management #process #reuse: Organizational Knowledge Management through Software Process Reuse and Case-based Reasoning (VAS, MIC), pp. 223–228.
ICEIS-ISAS-2010-WauteletKTK #development: Strategic Reasoning in Software Development (YW, SK, VT, MK), pp. 215–220.
CIKM-2010-ZhouLBXL #information management #mining #set: Rough sets based reasoning and pattern mining for a two-stage information filtering system (XZ, YL, PB, YX, RYKL), pp. 1429–1432.
ICML-2010-LangT #probability #relational: Probabilistic Backward and Forward Reasoning in Stochastic Relational Worlds (TL, MT), pp. 583–590.
KEOD-2010-ChanLB #automation #evolution #higher-order #ontology #representation: Higher-order Representation and Reasoning for Automated Ontology Evolution (MC, JL, AB), pp. 84–93.
KEOD-2010-DucLZ #api #distributed #ontology: An API for Distributed Reasoning on Networked Ontologies with Alignments (CLD, ML, AZ), pp. 295–304.
KEOD-2010-KorukhovaF #approach #synthesis: A Case-based Reasoning Approach to Program Synthesis (YK, NF), pp. 335–338.
KR-2010-AntoniouPB: Reasoning about Context in Ambient Intelligence Environments: A Report from the Field (GA, CP, AB).
KR-2010-Baral #multi: Reasoning about Actions and Change: From Single Agent Actions to Multi-Agent Actions (CB).
KR-2010-GiacomoLP #calculus #game studies #representation #source code: Situation Calculus Based Programs for Representing and Reasoning about Game Structures (GDG, YL, ARP).
KR-2010-GrauM #ontology: Pushing the Limits of Reasoning over Ontologies with Hidden Content (BCG, BM).
KR-2010-HajishirziA #probability: Reasoning about Deterministic Actions with Probabilistic Prior and Application to Stochastic Filtering (HH, EA).
KR-2010-HuL #correctness #problem: A Correctness Result for Reasoning about One-Dimensional Planning Problems (YH, HJL).
KR-2010-OrtizRS #owl #worst-case: Worst-Case Optimal Reasoning for the Horn-DL Fragments of OWL 1 and 2 (MO, SR, MS).
KR-2010-PradeR #logic: Reasoning with Logical Proportions (HP, GR).
SEKE-2010-ImM #architecture: Reasoning about Attribute Architectures (TI, JDM), pp. 165–171.
SEKE-2010-PaikariRR #case study #comparative #fault #predict #using: A Comparative Study of Attribute Weighting Techniques for Software Defect Prediction Using Case-based Reasoning (EP, MMR, GR), pp. 380–386.
ECOOP-2010-Owens #abstraction #concurrent #implementation: Reasoning about the Implementation of Concurrency Abstractions on x86-TSO (SO), pp. 478–503.
OOPSLA-2010-StadenC #abstraction #multi: Reasoning about multiple related abstractions with MultiStar (SvS, CC), pp. 504–519.
TOOLS-EUROPE-2010-NordioCMMT: Reasoning about Function Objects (MN, CC, BM, PM, JT), pp. 79–96.
SAC-2010-BagheriE: Evidential reasoning for the treatment of incoherent terminologies (EB, FE), pp. 1381–1387.
SAC-2010-dAmatoEFFGL #induction #semantics #web: Inductive reasoning and semantic web search (Cd, FE, NF, BF, GG, TL), pp. 1446–1447.
CASE-2010-JeongSM #assessment #design #framework #lifecycle: A framework for stepwise life cycle assessment during product design with case-based reasoning (MGJ, HWS, JRM), pp. 118–123.
DAC-2010-Miskov-ZivanovM #analysis #formal method #modelling #reliability: Formal modeling and reasoning for reliability analysis (NMZ, DM), pp. 531–536.
ESOP-2010-AmtoftHR #array #automation #certification #contract #data flow #precise #source code #verification: Precise and Automated Contract-Based Reasoning for Verification and Certification of Information Flow Properties of Programs with Arrays (TA, JH, ER), pp. 43–63.
ESOP-2010-MeolaW #fault tolerance #logic #source code: Faulty Logic: Reasoning about Fault Tolerant Programs (MLM, DW), pp. 468–487.
ESOP-2010-WickersonDP #composition: Explicit Stabilisation for Modular Rely-Guarantee Reasoning (JW, MD, MJP), pp. 610–629.
CAV-2010-ChenCFTTW #automation #learning: Automated Assume-Guarantee Reasoning through Implicit Learning (YFC, EMC, AF, MHT, YKT, BYW), pp. 511–526.
CAV-2010-CohenNS #composition: A Dash of Fairness for Compositional Reasoning (AC, KSN, YS), pp. 543–557.
CSL-2010-OHearn #abduction #deduction #induction: Abductive, Inductive and Deductive Reasoning about Resources (PWO), pp. 49–50.
ICLP-2010-RiguzziS10 #logic programming #source code: Tabling and Answer Subsumption for Reasoning on Logic Programs with Annotated Disjunctions (FR, TS), pp. 162–171.
ICLP-J-2010-SlotaL #towards: Towards closed world reasoning in dynamic open worlds (MS, JL), pp. 547–563.
IJCAR-2010-BeierleFKT #automation #information management #probability #relational #representation: Automated Reasoning for Relational Probabilistic Knowledge Representation (CB, MF, GKI, MT), pp. 218–224.
IJCAR-2010-GlimmHM #logic: Optimized Description Logic Reasoning via Core Blocking (BG, IH, BM), pp. 457–471.
IJCAR-2010-IhlemannS #on the: On Hierarchical Reasoning in Combinations of Theories (CI, VSS), pp. 30–45.
IJCAR-2010-MouraB #debugging #development: Bugs, Moles and Skeletons: Symbolic Reasoning for Software Development (LMdM, NB), pp. 400–411.
IJCAR-2010-PientkaD #deduction #framework #named #programming: Beluga: A Framework for Programming and Reasoning with Deductive Systems (BP, JD), pp. 15–21.
IJCAR-2010-Sofronie-Stokkermans #parametricity #verification: Hierarchical Reasoning for the Verification of Parametric Systems (VSS), pp. 171–187.
SAT-2010-GiunchigliaMN #effectiveness #equivalence #named #preprocessor: sQueezeBF: An Effective Preprocessor for QBFs Based on Equivalence Reasoning (EG, PM, MN), pp. 85–98.
VMCAI-2010-AlurC #source code: Temporal Reasoning for Procedural Programs (RA, SC), pp. 45–60.
VMCAI-2010-SummersD #design pattern: Considerate Reasoning and the Composite Design Pattern (AJS, SD), pp. 328–344.
WICSA-ECSA-2009-TangV #architecture #constraints #design #modelling: Modeling constraints improves software architecture design reasoning (AT, HvV), pp. 253–256.
VLDB-2009-FanJLM: Reasoning about Record Matching Rules (WF, XJ, JL, SM), pp. 407–418.
ITiCSE-2009-SitaramanHWDHLKP #evaluation #specification #student: Engaging students in specification and reasoning: “hands-on” experimentation and evaluation (MS, JOH, JW, SDS, HKH, DPL, JK, RP), pp. 50–54.
CIAA-J-2008-TsayW09 #automation #composition: Automated Compositional Reasoning of Intuitionistically Closed Regular Properties (YKT, BYW), pp. 747–762.
FM-2009-Gast #memory management: Reasoning about Memory Layouts (HG), pp. 628–643.
FM-2009-HasanAATA #random: Formal Reasoning about Expectation Properties for Continuous Random Variables (OH, NA, BA, ST, RA), pp. 435–450.
IFM-2009-DovlandJOS #incremental #inheritance #multi: Incremental Reasoning for Multiple Inheritance (JD, EBJ, OO, MS), pp. 215–230.
SEFM-2009-DzungO #elicitation #ontology #requirements: Ontology-Based Reasoning in Requirements Elicitation (DVD, AO), pp. 263–272.
TLCA-2009-Zhang #logic: The Computational SLR: A Logic for Reasoning about Computational Indistinguishability (YZ), pp. 401–415.
CEFP-2009-Hinze: Reasoning about Codata (RH), pp. 42–93.
AIIDE-2009-WeberM #game studies #order #realtime: Case-Based Reasoning for Build Order in Real-Time Strategy Games (BGW, MM).
CAiSE-2009-QueraltT #concept #uml: Reasoning on UML Conceptual Schemas with Operations (AQ, ET), pp. 47–62.
EDOC-2009-GovernatoriI #modelling #network #policy #social: Modelling and Reasoning Languages for Social Networks Policies (GG, RI), pp. 193–200.
ICEIS-ISAS-2009-KinderenGA #modelling #multi #using: Reasoning about Customer Needs in Multi-supplier ICT Service Bundles using Decision Models (SdK, JG, HA), pp. 131–136.
KEOD-2009-ArkoudasBK #logic: Qualitative Spatial Reasoning Via 3-Valued Heterogeneous Logic (KA, SB, SK), pp. 80–87.
KEOD-2009-HotzWKS #ontology #retrieval #similarity: Ontology-based Similarity of Software Cases — Applying Ontology Reasoning to Software Retrieval (LH, KW, SK, AS), pp. 183–191.
KEOD-2009-WandeltM: Updatable Island Reasoning for Alchi-ontologies (SW, RM), pp. 48–55.
SEKE-2009-LudwigTA #analysis #concept #database #deduction #performance #semantics #web: Performance Analysis of a Deductive Database with a Semantic Web Reasoning Engine: ConceptBase and Racer (SAL, CT, KA), pp. 688–693.
SIGIR-2009-WangTFZ #community #modelling #ranking: Ranking community answers by modeling question-answer relationships via analogical reasoning (XJW, XT, DF, LZ), pp. 179–186.
SPLC-2009-WhiteDSB #automation #feature model #multi #problem: Automated reasoning for multi-step feature model configuration problems (JW, BD, DCS, DB), pp. 11–20.
POPL-2009-BrotherstonC #logic: Classical BI: a logic for reasoning about dualising resources (JB, CC), pp. 328–339.
POPL-2009-Feng: Local rely-guarantee reasoning (XF), pp. 315–327.
PPDP-2009-FeltyM #hybrid: Reasoning with hypothetical judgments and open terms in hybrid (APF, AM), pp. 83–92.
QAPL-2009-MontaltoC #modelling: Modeling and Reasoning about an Attacker with Cryptanalytical Capabilities (BM, CC), pp. 143–165.
RE-2009-GhezziT #non-functional #requirements: Reasoning on Non-Functional Requirements for Integrated Services (CG, GT), pp. 69–78.
ICSE-2009-ThumBK #feature model #modelling: Reasoning about edits to feature models (TT, DSB, CK), pp. 254–264.
SAC-2009-CheriniB #abstraction: Local reasoning for abstraction and sharing (RC, JOB), pp. 552–557.
SAC-2009-GoncalvesZGF #ontology #representation #visualisation #web: An ontology-based application in heart electrophysiology: representation, reasoning and visualization on the web (BG, VZ, GG, JGPF), pp. 816–820.
SAC-2009-Hohn #modelling: Model-based reasoning on the achievement of business goals (SH), pp. 1589–1593.
SAC-2009-LeinoM #first-order #smt: Reasoning about comprehensions with first-order SMT solvers (KRML, RM), pp. 615–622.
SAC-2009-SilvaSC #library #testing #user interface: A generic library for GUI reasoning and testing (JCS, JS, JCC), pp. 121–128.
SAC-2009-StellerK #mobile #performance #pervasive: Efficient mobile reasoning for pervasive discovery (LS, SK), pp. 1247–1251.
CASE-2009-SubburajRA #3d #automation #geometry: Automated 3D geometric reasoning in Computer Assisted joint reconstructive surgery (KS, BR, MA), pp. 367–372.
ESOP-2009-DoddsFPV: Deny-Guarantee Reasoning (MD, XF, MJP, VV), pp. 363–377.
FoSSaCS-2009-Alur: Temporal Reasoning about Program Executions (RA), p. 15.
CADE-2009-Korovin #automation #theory and practice: Instantiation-Based Automated Reasoning: From Theory to Practice (KK), pp. 163–166.
CADE-2009-LudwigH: Fair Derivations in Monodic Temporal Reasoning (ML, UH), pp. 261–276.
CADE-2009-Rinard #proving: Integrated Reasoning and Proof Choice Point Selection in the Jahob System — Mechanisms for Program Survival (MCR), pp. 1–16.
CAV-2009-Jacobs #generative #incremental: Incremental Instance Generation in Local Reasoning (SJ), pp. 368–382.
ICLP-2009-GavanelliAL #abduction #constraints #integration #optimisation: Integration of Abductive Reasoning and Constraint Optimization in SCIFF (MG, MA, EL), pp. 387–401.
ICLP-2009-Simari #behaviour #modelling #probability: Stochastic Reasoning with Models of Agent Behavior (GIS), pp. 538–539.
ISSTA-2009-ElkarabliehGL #generative #pointer #precise #testing: Precise pointer reasoning for dynamic test generation (BE, PG, MYL), pp. 129–140.
MBT-2009-AichernigBW #consistency #hybrid #modelling #testing: Conformance Testing of Hybrid Systems with Qualitative Reasoning Models (BKA, HB, FW), pp. 53–69.
SAT-2009-BeyersdorffMTV #complexity #logic: The Complexity of Reasoning for Fragments of Default Logic (OB, AM, MT, HV), pp. 51–64.
SAT-2009-Chen #hybrid #satisfiability: Building a Hybrid SAT Solver via Conflict-Driven, Look-Ahead and XOR Reasoning Techniques (JC), pp. 298–311.
QoSA-2008-PaceKBBB #design #framework: Integrating Quality-Attribute Reasoning Frameworks in the ArchE Design Assistant (ADP, HK, LB, PB, FB), pp. 171–188.
QoSA-2008-TangTHV #design #quality: Design Reasoning Improves Software Design Quality (AT, MHT, JH, HvV), pp. 28–42.
PODS-2008-GardnerSWZ #hoare: Local Hoare reasoning about DOM (PG, GS, MJW, UZ), pp. 261–270.
VLDB-2008-LiuC #identification #keyword #xml: Reasoning and identifying relevant matches for XML keyword search (ZL, YC), pp. 921–932.
CIAA-2008-TsayW #automation #composition: Automated Compositional Reasoning of Intuitionistically Closed Regular Properties (YKT, BYW), pp. 36–45.
SEFM-2008-SchaeferP #adaptation #composition #embedded #modelling #verification: Compositional Reasoning in Model-Based Verification of Adaptive Embedded Systems (IS, APH), pp. 95–104.
FLOPS-2008-MellarkodG #constraints #set #theorem proving: Integrating Answer Set Reasoning with Constraint Solving Techniques (VSM, MG), pp. 15–31.
FLOPS-2008-Schaub #information management #modelling #programming #representation #set: Model-Based Knowledge Representation and Reasoning Via Answer Set Programming (TS), pp. 1–2.
AIIDE-2008-BergsmaS #adaptation #game studies: Adaptive Spatial Reasoning for Turn-based Strategy Games (MHJB, PS).
GT-VMT-2006-XuLW08 #visual notation: BPSL Modeler — Visual Notation Language for Intuitive Business Property Reasoning (KX, YL, CW), pp. 211–220.
GT-VMT-2008-GrabskaSL #design #graph transformation #using #visual notation: Visual Design and Reasoning with the Use of Hypergraph Transformations (EG, GMS, TLL).
CHI-2008-ShrinivasanW #process #visualisation: Supporting the analytical reasoning process in information visualization (YBS, JJvW), pp. 1237–1246.
CAiSE-2008-KinderenG: Reasoning about Substitute Choices and Preference Ordering in e-Services (SdK, JG), pp. 390–404.
CAiSE-2008-QueraltT #constraints #decidability #uml: Decidable Reasoning in UML Schemas with Constraints (AQ, ET), pp. 281–295.
ICEIS-AIDSS-2008-SchmidtV #using: Using Case-Based Reasoning to Explain Exceptional Cases (RS, OV), pp. 119–124.
ICEIS-ISAS2-2008-AmiratO #architecture #modelling #representation: Representation and Reasoning Models for C3 Architecture Description Language (AA, MO), pp. 207–212.
ICEIS-SAIC-2008-StellerKCNL #approach #pervasive #semantics #using: A Weighted Approach for Optimised Reasoning for Pervasive Service Discovery Using Semantics and Context (LS, SK, SC, JN, SWL), pp. 113–118.
KR-2008-AlechinaDLM: Reasoning about Agent Deliberation (NA, MD, BL, JJCM), pp. 16–26.
KR-2008-Balbiani #analysis #representation #standard: Time Representation and Temporal Reasoning from the Perspective of Non-Standard Analysis (PB), pp. 695–704.
KR-2008-DohertyS #using: Reasoning with Qualitative Preferences and Cardinalities using Generalized Circumscription (PD, AS), pp. 560–570.
KR-2008-Kern-Isberner: Linking Iterated Belief Change Operations to Nonmonotonic Reasoning (GKI), pp. 166–176.
KR-2008-Saint-Cyr: Scenario Update Applied to Causal Reasoning (FDdSC), pp. 188–197.
KR-2008-WittocxMD #approximate #first-order #logic: Approximate Reasoning in First-Order Logic Theories (JW, MM, MD), pp. 103–112.
SEKE-2008-BrandlFW #modelling #testing #using: Coverage-based Testing Using Qualitative Reasoning Models (HB, GF, FW), pp. 393–398.
ECMDA-FA-2008-GoknilKB #approach #metamodelling #requirements: A Metamodeling Approach for Reasoning about Requirements (AG, IK, KvdB), pp. 310–325.
ECOOP-2008-BanerjeeNR #invariant #logic: Regional Logic for Local Reasoning about Global Invariants (AB, DAN, SR), pp. 387–411.
PADL-2008-EshkevariAC #analysis #aspect-oriented #comprehension #declarative #dependence #source code: Comprehension and Dependency Analysis of Aspect-Oriented Programs through Declarative Reasoning (LME, VA, CC), pp. 35–52.
PADL-2008-Subbarayan #constraints #performance #theorem proving: Efficient Reasoning for Nogoods in Constraint Solvers with BDDs (SS), pp. 53–67.
PPDP-2008-CaballeroRR #logic programming #similarity: Similarity-based reasoning in qualified logic programming (RC, MRA, CARD), pp. 185–194.
SAS-2008-PerryW #control flow #fault: Reasoning about Control Flow in the Presence of Transient Faults (FP, DW), pp. 332–346.
SAC-2008-AdnaneSBM #behaviour #detection #trust: Autonomic trust reasoning enables misbehavior detection in OLSR (AA, RTdSJ, CB, LM), pp. 2006–2013.
SAC-2008-AntoniouDG: A system for modal and deontic defeasible reasoning (GA, ND, GG), pp. 2261–2265.
SAC-2008-GrutterBH #ontology: Extending an ontology-based search with a formalism for spatial reasoning (RG, BBM, MH), pp. 2266–2270.
SAC-2008-MotaCFEB #deforestation #evolution: Applying case-based reasoning in the evolution of deforestation patterns in the Brazilian Amazonia (JSM, GC, LMGF, MISE, ORFdOB), pp. 1683–1687.
SAC-2008-VazquezCP #approach #architecture #design #object-oriented: A case-based reasoning approach for materializing software architectures onto object-oriented designs (GLV, MRC, JADP), pp. 842–843.
PPoPP-2008-SandersK #memory management #modelling: Assertional reasoning about data races in relaxed memory models (BAS, KK), pp. 267–268.
FASE-2008-MossakowskiSG #logic: A Generic Complete Dynamic Logic for Reasoning About Purity and Effects (TM, LS, SG), pp. 199–214.
FoSSaCS-2008-RazaG: Footprints in Local Reasoning (MR, PG), pp. 201–215.
TACAS-2008-IhlemannJS #on the #verification: On Local Reasoning in Verification (CI, SJ, VSS), pp. 265–281.
TACAS-2008-Kovacs #algebra: Reasoning Algebraically About P-Solvable Loops (LK), pp. 249–264.
CAV-2008-BobaruPG #abstraction #automation #refinement: Automated Assume-Guarantee Reasoning by Abstraction Refinement (MGB, CSP, DG), pp. 135–148.
CAV-2008-EisnerNY #composition #design #functional #power management #verification: Functional Verification of Power Gated Designs by Compositional Reasoning (CE, AN, KY), pp. 433–445.
CAV-2008-MagillTLT #named: THOR: A Tool for Reasoning about Shape and Arithmetic (SM, MHT, PL, YKT), pp. 428–432.
ICLP-2008-Baral #information management #programming #representation #set #using: Using Answer Set Programming for Knowledge Representation and Reasoning: Future Directions (CB), pp. 69–70.
ICLP-2008-BuccafurriCL #logic #semantics #social: A Logic Language with Stable Model Semantics for Social Reasoning (FB, GC, RL), pp. 718–723.
ICLP-2008-LukacsySK #logic #prolog: Prolog Based Description Logic Reasoning (GL, PS, BK), pp. 455–469.
ICLP-2008-Pirrotta #web: Extracting and Reasoning about Web Data (GP), pp. 813–814.
IJCAR-2008-BeierleKK #automation #implementation: A High-Level Implementation of a System for Automated Reasoning with Default Rules (CB, GKI, NK), pp. 147–153.
IJCAR-2008-MotikH #logic #reuse: Individual Reuse in Description Logic Reasoning (BM, IH), pp. 242–258.
IJCAR-2008-UrbanSPV #automation #semantics: MaLARea SG1- Machine Learner for Automated Reasoning with Semantic Guidance (JU, GS, PP, JV), pp. 441–456.
ICDAR-2007-HamzaBB #approach: A Case-Based Reasoning Approach for Invoice Structure Extraction (HH, YB, AB), pp. 327–331.
PODS-2007-CautisAM #constraints #xml: Reasoning about XML update constraints (BC, SA, TM), pp. 195–204.
PODS-2007-KasneciS #complexity #xml: The complexity of reasoning about pattern-based XML schemas (GK, TS), pp. 155–164.
VLDB-2007-LuMZBWPY #named #ontology: SOR: A Practical System for Ontology Storage, Reasoning and Search (JL, LM, LZ, JSB, CW, YP, YY), pp. 1402–1405.
VLDB-2007-RomanK #behaviour #concurrent #logic #semantics #transaction #web #web service: Reasoning about the Behavior of Semantic Web Services with Concurrent Transaction Logic (DR, MK), pp. 627–638.
CSEET-2007-McGregorBBBK #architecture #education #using: Using an Architecture Reasoning Tool to Teach Software Architecture (JDM, FB, LB, PB, MK), pp. 275–282.
IFM-2007-MeinickeS #development #process #realtime #reliability: A Stepwise Development Process for Reasoning About the Reliability of Real-Time Systems (LM, GS), pp. 439–458.
SEFM-2007-CastroM #fault tolerance #logic: An ought-to-do deontic logic for reasoning about fault-tolerance: the diarrheic philosophers (PFC, TSEM), pp. 151–160.
SEFM-2007-CrockerC #automation #c #source code #using #verification: Verification of C Programs Using Automated Reasoning (DC, JC), pp. 7–14.
SEFM-2007-JacobsMP #exception: Sound reasoning about unchecked exceptions (BJ, PM, FP), pp. 113–122.
ICFP-2007-FilinskiS #data type #induction: Inductive reasoning about effectful data types (AF, KS), pp. 97–110.
ICEIS-AIDSS-2007-CaropreseTZ #implementation #logic programming: Implementing Prioritized Reasoning in Logic Programming (LC, IT, EZ), pp. 94–100.
ICEIS-AIDSS-2007-Cebulla #coordination #semantics #specification #towards: Reactive Commonsense Reasoning — Towards Semantic Coordination with High-Level Specifications (MC), pp. 113–118.
ICEIS-AIDSS-2007-VaginY #modelling: Modelling Human Reasoning in Intelligent Decision Support Systems (VNV, APY), pp. 277–282.
CIKM-2007-SchockaertC: Reasoning about vague topological information (SS, MDC), pp. 593–602.
SEKE-2007-HuangL07a #composition #using: Service Composition Using Planning and Case-Based Reasoning (KHH, AL), pp. 610–615.
SEKE-2007-RushtonT #source code: A Language Facilitating Informal Reasoning about Programs (JNR, DT), p. 396–?.
SIGIR-2007-Schockaert #fuzzy #information retrieval: Fuzzy temporal and spatial reasoning for intelligent information retrieval (SS), p. 921.
ECMDA-FA-2007-MaraeeB #diagrams #finite #performance #satisfiability #set #uml: Efficient Reasoning About Finite Satisfiability of UML Class Diagrams with Constrained Generalization Sets (AM, MB), pp. 17–31.
MoDELS-2007-JacksonS: Constructive Techniques for Meta- and Model-Level Reasoning (EKJ, JS), pp. 405–419.
SPLC-2007-JanotaK #feature model #higher-order #logic #modelling: Reasoning about Feature Models in Higher-Order Logic (MJ, JRK), pp. 13–22.
MoDELS-2007-JacksonS: Constructive Techniques for Meta- and Model-Level Reasoning (EKJ, JS), pp. 405–419.
ECOOP-2007-BalzerGE #relational: A Relational Model of Object Collaborations and Its Use in Reasoning About Relationships (SB, TRG, PE), pp. 323–346.
ECOOP-2007-CliftonLN #aspect-oriented #effectiveness #named: MAO: Ownership and Effects for More Effective Reasoning About Aspects (CC, GTL, JN), pp. 451–475.
PPDP-2007-Berdine: Local reasoning about storable locks (JB), p. 153.
SAS-2007-Brotherston #induction #logic: Formalised Inductive Reasoning in the Logic of Bunched Implications (JB), pp. 87–103.
SIGAda-2007-Lau #imperative #source code #using: Using SPARK for a beginner’s course on reasoning about imperative programs (KKL), pp. 75–78.
SAC-2007-CaropreseTZ #evaluation #framework: A framework for prioritized reasoning based on the choice evaluation (LC, IT, EZ), pp. 65–70.
ESOP-2007-FengFS #concurrent #logic #on the: On the Relationship Between Concurrent Separation Logic and Assume-Guarantee Reasoning (XF, RF, ZS), pp. 173–188.
FASE-2007-DarvasL #implementation: Practical Reasoning About Invocations and Implementations of Pure Methods (ÁD, KRML), pp. 336–351.
FoSSaCS-2007-YoshidaHB #higher-order #logic: Logical Reasoning for Higher-Order Functions with Local State (NY, KH, MB), pp. 361–377.
TACAS-2007-BouajjaniJS #framework #infinity #network #process: A Generic Framework for Reasoning About Dynamic Networks of Infinite-State Processes (AB, YJ, MS), pp. 690–705.
TACAS-2007-ChakiS: Optimized L*-Based Assume-Guarantee Reasoning (SC, OS), pp. 276–291.
CADE-2007-HofnerS #algebra #automation: Automated Reasoning in Kleene Algebra (PH, GS), pp. 279–294.
CADE-2007-MotikSH #logic #using: Optimized Reasoning in Description Logics Using Hypertableaux (BM, RS, IH), pp. 67–83.
CSL-2007-BodirskyC #revisited: Qualitative Temporal and Spatial Reasoning Revisited (MB, HC), pp. 194–207.
CSL-2007-Goller #complexity #on the #policy: On the Complexity of Reasoning About Dynamic Policies (SG), pp. 358–373.
TAP-2007-SmaragdakisC #debugging #detection: Combining Static and Dynamic Reasoning for Bug Detection (YS, CC), pp. 1–16.
VMCAI-2007-CheremR #analysis #invariant #maintenance: Maintaining Doubly-Linked List Invariants in Shape Analysis with Local Reasoning (SC, RR), pp. 234–250.
CBSE-2006-Lumpe #abstraction #component #framework #modelling #named: GLoo: A Framework for Modeling and Reasoning About Component-Oriented Language Abstractions (ML), pp. 17–32.
QoSA-2006-KruchtenLV #architecture: Building Up and Reasoning About Architectural Knowledge (PK, PL, HvV), pp. 43–58.
PODS-2006-BojanczykDMSS #logic #xml: Two-variable logic on data trees and XML reasoning (MB, CD, AM, TS, LS), pp. 10–19.
FM-2006-Mostowski #java #logic: Formal Reasoning About Non-atomic Java Card Methods in Dynamic Logic (WM), pp. 444–459.
FLOPS-2006-BartheFPR #coq #proving #recursion: Defining and Reasoning About Recursive Functions: A Practical Tool for the Coq Proof Assistant (GB, JF, DP, VR), pp. 114–129.
Haskell-2006-Gill #equation #haskell: Introducing the Haskell equational reasoning assistant (AG), pp. 108–109.
ICEIS-AIDSS-2006-Zenzerovic: Utilization of Case-Based Reasoning in Auditing — Determining the Audit Fee (RZ), pp. 182–188.
ICEIS-J-2006-KoutsomitropoulosMKP06a #framework #logic #semantics #web: Establishing the Semantic Web Reasoning Infrastructure on Description Logic Inference Engines (DAK, DPM, ANK, TSP), pp. 351–362.
KR-2006-HalpernR: Reasoning about Knowledge of Unawareness (JYH, LCR), pp. 6–13.
KR-2006-Saint-CyrP #fuzzy #modelling #nondeterminism #persistent: Possibilistic Handling of Uncertain Default Rules with Applications to Persistence Modeling and Fuzzy Default Reasoning (FDdSC, HP), pp. 440–451.
KR-2006-SannerM #calculus #first-order #hybrid #logic: An Ordered Theory Resolution Calculus for Hybrid Reasoning in First-Order Extensions of Description Logic (SS, SAM), pp. 100–111.
KR-2006-SirinGP #logic #optimisation: From Wine to Water: Optimizing Description Logic Reasoning for Nominals (ES, BCG, BP), pp. 90–99.
KR-2006-SonT #approximate #on the: On the Completeness of Approximation Based Reasoning and Planning in Action Theories with Incomplete Information (TCS, PHT), pp. 481–491.
SPL-BOOK-2006-ArciniegasDRCBO #architecture #evolution #product line #security: Architecture Reasoning for Supporting Product Line Evolution: An Example on Security (JLA, JCD, JLR, RC, JBM, MO), pp. 327–372.
POPL-2006-DanielssonHJG #performance: Fast and loose reasoning is morally correct (NAD, JH, PJ, JG), pp. 206–217.
POPL-2006-KoutavasW #bisimulation #higher-order #imperative #source code: Small bisimulations for reasoning about higher-order imperative programs (VK, MW), pp. 141–152.
ASE-2006-FalcarinT #aspect-oriented #automation #interactive: Automated Reasoning on Aspects Interactions (PF, MT), pp. 313–316.
FSE-2006-JhalaM: Bit level types for high level reasoning (RJ, RM), pp. 128–140.
SAC-2006-SherchanLK #fuzzy #web #web service: A fuzzy model for reasoning about reputation in web services (WS, SWL, SK), pp. 1886–1892.
GPCE-2006-Prehofer #composition #multi #semantics: Semantic reasoning about feature composition via multiple aspect-weavings (CP), pp. 237–242.
ESOP-2006-JiaW #automation #named #pointer #source code: ILC: A Foundation for Automated Reasoning About Pointer Programs (LJ, DW), pp. 131–145.
CSL-2006-ChadhaMS #probability #source code: Reasoning About States of Probabilistic Sequential Programs (RC, PM, AS), pp. 240–255.
ICLP-2006-Lukacsy #logic #prolog: Description Logic Reasoning in Prolog (GL), pp. 463–464.
ICLP-2006-Tu #performance: Efficient Reasoning About Action and Change in the Presence of Incomplete Information and Its Application in Planning (PHT), pp. 469–470.
IJCAR-2006-DoughertyFK #policy #specification: Specifying and Reasoning About Dynamic Access-Control Policies (DJD, KF, SK), pp. 632–646.
IJCAR-2006-Miller #representation #semantics: Representing and Reasoning with Operational Semantics (DM), pp. 4–20.
IJCAR-2006-ZimmerA #semantics #web: The MathServe System for Semantic Web Reasoning Services (JZ, SA), pp. 140–144.
ISSTA-2006-CobleighAC #composition: Breaking up is hard to do: an investigation of decomposition for assume-guarantee reasoning (JMC, GSA, LAC), pp. 97–108.
LICS-2006-Leivant #logic #proving #source code: Matching Explicit and Modal Reasoning about Programs: A Proof Theoretic Delineation of Dynamic Logic (DL), pp. 157–168.
SAT-2006-SamulowitzB: Binary Clause Reasoning in QBF (HS, FB), pp. 353–367.
RTA-2005-HendrixCM #specification: A Sufficient Completeness Reasoning Tool for Partial Specifications (JH, MC, JM), pp. 165–174.
TLCA-2005-BentonL #relational #semantics: Relational Reasoning in a Nominal Semantics for Storage (NB, BL), pp. 86–101.
CAiSE-2005-BenavidesTC #automation #feature model #modelling: Automated Reasoning on Feature Models (DB, PTMA, ARC), pp. 491–503.
KDD-2005-ZakiR #mining #set #using: Reasoning about sets using redescription mining (MJZ, NR), pp. 364–373.
MLDM-2005-LeHS #ambiguity #approach #classification #word: An Evidential Reasoning Approach to Weighted Combination of Classifiers for Word Sense Disambiguation (CAL, VNH, AS), pp. 516–525.
SEKE-2005-BrandaoSL #design #knowledge-based #multi #using #verification: Multi-Agent System Design Verification Using Knowledge-based Reasoning (AB, VTdS, CJPdL), pp. 602–607.
SEKE-2005-WangDS #alloy #using: Reasoning Support for SWRL-FOL Using Alloy (HHW, JSD, JS), pp. 626–631.
SEKE-2005-YangLH: An Ontology-Supported Case-Based Reasoning Technique for FAQ Proxy Service (SYY, PCL, CSH), pp. 639–644.
SEKE-2005-Zhu #behaviour #multi: Formal Reasoning about Emergent Behaviours of Multi-Agent Systems (HZ), pp. 280–285.
ECOOP-2005-Aldrich #composition: Open Modules: Modular Reasoning About Advice (JA), pp. 144–168.
ASE-2005-DominguezD #composition #distributed: Compositional reasoning for port-based distributed systems (ALJD, NAD), pp. 376–379.
ASE-2005-Grov #algorithm #approach #correctness #deduction #source code #verification: Verifying the correctness of hume programs: an approach combining deductive and algorithmic reasoning (GG), pp. 444–447.
ASE-2005-ShankarASX #realtime #semantics: Reasoning about real-time statecharts in the presence of semantic variations (SS, SA, VS, XX), pp. 243–252.
ESEC-FSE-2005-LandtsheerL #requirements: Reasoning about confidentiality at requirements engineering time (RDL, AvL), pp. 41–49.
ICSE-2005-DemskyR #data type #using: Data structure repair using goal-directed reasoning (BD, MCR), pp. 176–185.
ICSE-2005-KiczalesM #aspect-oriented #composition #programming: Aspect-oriented programming and modular reasoning (GK, MM), pp. 49–58.
GPCE-2005-WuL #programming #source code #using: Shadow Programming: Reasoning About Programs Using Lexical Join Point Information (PW, KJL), pp. 141–156.
COCV-J-2005-Langmaack #question #what: What Level of Mathematical Reasoning can Computer Science Demand of a Software Implementer? (HL), pp. 5–32.
SAT-J-2004-GiunchigliaNT05: QBF Reasoning on Real-World Instances (EG, MN, AT), pp. 105–121.
SAT-J-2004-HeuleDZM05 #implementation #named #performance #satisfiability: March_eq: Implementing Additional Reasoning into an Efficient Look-Ahead SAT Solver (MH, MD, JvZ, HvM), pp. 345–359.
CADE-2005-Brown #similarity #type system: Reasoning in Extensional Type Theory with Equality (CEB), pp. 23–37.
CADE-2005-Sofronie-Stokkermans: Hierarchic Reasoning in Local Theory Extensions (VSS), pp. 219–234.
CAV-2005-ChakiCST #automation #consistency #simulation: Automated Assume-Guarantee Reasoning for Simulation Conformance (SC, EMC, NS, PT), pp. 534–547.
CAV-2005-ChakiISW #framework: The ComFoRT Reasoning Framework (SC, JI, NS, KCW), pp. 164–169.
CAV-2005-KahlonIG #communication #thread: Reasoning About Threads Communicating via Locks (VK, FI, AG), pp. 505–518.
CSL-2005-Baaz: Note on Formal Analogical Reasoning in the Juridical Context (MB), pp. 18–26.
ICLP-2005-LukacsyN #datalog: Open World Reasoning in Datalog (GL, ZN), pp. 427–428.
ICLP-2005-Rossi: Preference Reasoning (FR), pp. 5–8.
ICALP-2004-Skelley #quantifier #source code: Propositional PSPACE Reasoning with Boolean Programs Versus Quantified Boolean Formulas (AS), pp. 1163–1175.
SEFM-2004-Struth #automation #set: Automated Element-Wise Reasoning with Sets (GS), pp. 320–329.
IFL-2004-DowseBE #concurrent #functional: Reasoning About Deterministic Concurrent Functional I/O (MD, AB, MCJDvE), pp. 177–194.
ICEIS-v2-2004-BailonDGT #approach: A Connexionist Approach for Case Based Reasoning (ABB, MD, ELGG, JMdlT), pp. 369–374.
ICEIS-v2-2004-BaykalAP #automation #recommendation: Automated Product Recommendation by Employing Case-Based Reasoning Agents (MÖB, RA, FP), pp. 515–518.
ICEIS-v2-2004-BillyMPC #adaptation #approach: Model P: An Approach of the Adaptability of Case-Based Reasoning Systems (MB, FXM, CP, LC), pp. 357–362.
ICEIS-v2-2004-MarirM #named #process: CBR-BPR: A Case-Based Reasoning Tool for Business Process Redesign (FM, SLM), pp. 363–368.
ICEIS-v2-2004-OgielaTO #algorithm #information management #visual notation: Cognitive Reasoning in Intelligent Medical Information Systems — Visual Data Perception Algorithms in Medical Decision support Systems (MRO, RT, LO), pp. 222–225.
ICML-2004-RudarySP #adaptation #constraints #learning: Adaptive cognitive orthotics: combining reinforcement learning and constraint-based temporal reasoning (MRR, SPS, MEP).
KR-2004-BenferhatBN #analysis: An Experimental Analysis of Possibilistic Default Reasoning (SB, JFB, RDSN), pp. 130–140.
KR-2004-DelgrandeST: Domain-Specific Preferences for Causal Reasoning and Planning (JPD, TS, HT), pp. 673–682.
KR-2004-KaneiwaM #knowledge base #ontology: Ontological Knowledge Base Reasoning with Sort-Hierarchy and Rigidity (KK, RM), pp. 278–288.
KR-2004-LiuLL #logic: A Logic of Limited Belief for Reasoning with Disjunctive Information (YL, GL, HJL), pp. 587–597.
KR-2004-McCarthy: Historical Remarks on Nonmonotonic Reasoning, Especially Circumscription (JM0), pp. 738–739.
KR-2004-SuLZ: Reasoning about Knowledge by Variable Forgetting (KS, GL, YZ), pp. 576–586.
KR-2004-TranB #interactive #prolog: Reasoning about Triggered Actions in AnsProlog and Its Application to Molecular Interactions in Cells (NT, CB), pp. 554–564.
KR-2004-TranHH: Observation Expectation Reasoning in Agent Systems (BVT, JH, MH), pp. 246–254.
PADL-2004-ElkhatibPS #named #prolog #set #source code: ASP-PROLOG: A System for Reasoning about Answer Set Programs in Prolog (OEK, EP, TCS), pp. 148–162.
PDCL-2004-HoweKL #logic programming #source code: Analysing Logic Programs by Reasoning Backwards (JMH, AK, LL), pp. 152–188.
POPL-2004-BirkedalTR #garbage collection: Local reasoning about a copying garbage collector (LB, NTS, JCR), pp. 220–231.
PPDP-2004-GrecoGSS #datalog #logic programming #multi #programming language: Event choice datalog: a logic programming language for reasoning in multiple dimensions (GG, AG, DS, FS), pp. 238–249.
FSE-2004-LetierL #design #requirements: Reasoning about partial goal satisfaction for requirements and design engineering (EL, AvL), pp. 53–62.
DATE-v1-2004-WedlerSK #satisfiability: Arithmetic Reasoning in DPLL-Based SAT Solving (MW, DS, WK), pp. 30–35.
ESOP-2004-OHearn #concurrent: Resources, Concurrency, and Local Reasoning (PWO), pp. 1–2.
FASE-2004-HubbersP #java #transaction: Reasoning about Card Tears and Transactions in Java Card (EH, EP), pp. 114–128.
FoSSaCS-2004-PucellaW #policy: Reasoning about Dynamic Policies (RP, VW), pp. 453–467.
CSL-2004-GanzingerK #equation #proving #theorem proving: Integrating Equational Reasoning into Instantiation-Based Theorem Proving (HG, KK), pp. 71–84.
LICS-2004-NaumannB #imperative #invariant #towards: Towards Imperative Modules: Reasoning about Invariants and Sharing of Mutable State (DAN, MB), pp. 313–323.
SAT-2004-GiunchigliaNT: QBF Reasoning on Real-World Instances (EG, MN, AT), pp. 247–254.
FME-2003-DongSW #alloy #semantics #web: Checking and Reasoning about Semantic Web through Alloy (JSD, JS, HHW), pp. 796–813.
FME-2003-XieBK #composition: Translation-Based Compositional Reasoning for Software Systems (FX, JCB, RPK), pp. 582–599.
ICEIS-v2-2003-LamontagneL #email: Applying Case-Based Reasoning to Email Response (LL, GL), pp. 115–123.
ICEIS-v2-2003-OgielaTO #information management: Content-Based Reasoning in Intelligent Medical Information Systems (MRO, RT, LO), pp. 503–506.
ICEIS-v3-2003-CaroGGCA #approach #communication #modelling #workflow: A Temporal Reasoning Approach of Communication Based Workflow Modelling (JLC, AG, SG, AC, AA), pp. 245–250.
MLDM-2003-Craw #learning: Introspective Learning to Build Case-Based Reasoning (CBR) Knowledge Containers (SC), pp. 1–6.
SEKE-2003-Cebulla #adaptation #architecture #using #variability: Reasoning about Variability and structural Adaptation in Sociotechnical Systems Using Dynamic Architectures (MC), pp. 406–413.
UML-2003-Egyed #abstraction #composition #relational: Compositional and Relational Reasoning during Class Abstraction (AE), pp. 121–137.
LOPSTR-2003-Ruiz-ReinaJHM #case study #data type #performance: Formal Reasoning about Efficient Data Structures: A Case Study in ACL2 (JLRR, JAAJ, MJH, FJMM), pp. 75–91.
PADL-2003-PontelliBB #platform: Non-monotonic Reasoning on Beowulf Platforms (EP, MB, FB), pp. 37–57.
ICSE-2003-Dingel: Computer-Assisted Assume/Guarantee Reasoning with VeriSoft (JD), pp. 138–148.
ICSE-2003-EasterbrookCDGLPTT #model checking #multi #named: χChek: A Model Checker for Multi-Valued Reasoning (SME, MC, BD, AG, AYCL, VP, AT, CDTW), pp. 804–805.
FoSSaCS-2003-PowerT #abstraction: Abstraction in Reasoning about Higraph-Based Systems (JP, KT), pp. 392–408.
FoSSaCS-2003-SprengerD #calculus #induction #on the #proving #μ-calculus: On the Structure of Inductive Reasoning: Circular and Tree-Shaped Proofs in the μ-Calculus (CS, MD), pp. 425–440.
CADE-2003-Belinfante: Reasoning about Iteration in Gödel’s Class Theory (JGFB), pp. 228–242.
CADE-2003-Cohn: Reasoning about Qualitative Representations of Space and Time (AGC), p. 334.
CADE-2003-GanzingerS #equivalence #normalisation: Superposition with Equivalence Reasoning and Delayed Clause Normal Form Transformation (HG, JS), pp. 335–349.
CADE-2003-LutzST #complexity #finite #logic: The Complexity of Finite Model Reasoning in Description Logics (CL, US, LT), pp. 60–74.
CADE-2003-Nelson #quantifier: Reasoning about Quantifiers by Matching in the E-graph (GN), p. 166.
CAV-2003-EisnerFHLMC #logic: Reasoning with Temporal Logic on Truncated Paths (CE, DF, JH, YL, AM, DVC), pp. 27–39.
LICS-2003-AhmedJW: Reasoning about Hierarchical Storage (AJA, LJ, DW), pp. 33–44.
VMCAI-2003-MeenakshiR #message passing: Reasoning about Layered Message Passing Systems (BM, RR), pp. 268–282.
CBSE-2002-AguirreM #approach #component #logic #specification: A Temporal Logic Approach to Component–Based System Specification and Reasoning (NA, TM), p. 11.
CBSE-2003-WeideOS #composition #performance: Expressiveness Issues in Compositional Performance Reasoning (BWW, WFO, MS), p. 15.
ICEIS-2002-AbadSRO #constraints #development #programming: Semiqualitative Reasoning for Software Development Project by Constraint Programming (PJA, AJS, SR, JAO), pp. 319–324.
KR-2002-CalvaneseGV #ltl: Reasoning about Actions and Planning in LTL Action Theories (DC, GDG, MYV), pp. 593–602.
KR-2002-DomshlakB #consistency #named #testing: CP-nets: Reasoning and Consistency Testing (CD, RIB), pp. 121–132.
KR-2002-Kern-Isberner #approach: A Structural Approach to Default Reasoning (GKI), pp. 147–157.
KR-2002-Lakemeyer #first-order #knowledge base: Evaluation-Based Reasoning with Disjunctive Information in First-Order Knowledge Bases (GL), pp. 73–81.
ECOOP-2002-AldrichCN #architecture: Architectural Reasoning in ArchJava (JA, CC, DN), pp. 334–367.
TOOLS-USA-2002-PaigeKOL #automation #named #specification: BON-CASE: An Extensible CASE Tool for Formal Specification and Reasoning (RFP, LK, JSO, JL), pp. 77–96.
ASE-2002-GrosserSV #predict #using: Predicting Software Stability Using Case-Based Reasoning (DG, HAS, PV), p. 295–?.
ICSE-2002-PonsB #correctness #development #process: Reasoning about the correctness of software development process (CP, GB), p. 708.
FoSSaCS-2002-BorealeG #calculus #composition #on the: On Compositional Reasoning in the Sπ-calculus (MB, DG), pp. 67–81.
FoSSaCS-2002-YangO #semantics: A Semantic Basis for Local Reasoning (HY, PWO), pp. 402–416.
CADE-2002-AudemardB #finite #generative #symmetry: Reasoning by Symmetry and Function Ordering in Finite Model Generation (GA, BB), pp. 226–240.
CADE-2002-Horrocks #logic #theory and practice: Reasoning with Expressive Description Logics: Theory and Practice (IH), pp. 1–15.
CADE-2002-Paulson #case study #theorem: The Reflection Theorem: A Study in Meta-theoretic Reasoning (LCP), pp. 377–391.
CADE-2002-ZimmerK #distributed: System Description: The MathWeb Software Bus for Distributed Mathematical Reasoning (JZ, MK), pp. 139–143.
ICLP-2002-Bonatti #infinity #modelling #source code: Reasoning with Infinite Stable Models II: Disjunctive Programs (PAB), pp. 333–346.
ICLP-2002-Thielscher #constraints #finite: Reasoning about Actions with CHRs and Finite Domain Constraints (MT), pp. 70–84.
SAT-2002-Bacchus #trade-off: Exploring the computational tradeoff of more reasoning and less searching (FB), p. 34.
SAT-2002-Gelder #satisfiability #towards: Toward leaner binary-clause reasoning in a satisfiability solver (AVG), p. 16.
SAT-2002-Marques-Silva #satisfiability: Hypothetical reasoning in propositional satisfiability (JMS), p. 14.
CBSE-2001-Sitaraman #composition #performance: Compositional Performance Reasoning (MS), p. 19.
ICALP-2001-Madhusudan #behaviour #branch #graph #sequence: Reasoning about Sequential and Branching Behaviours of Message Sequence Graphs (PM), pp. 809–820.
ICALP-2001-Maier #framework: A Set-Theoretic Framework for Assume-Guarantee Reasoning (PM), pp. 821–834.
ICALP-2001-ViswanathanV #composition: Foundations for Circular Compositional Reasoning (MV, RV), pp. 835–847.
FME-2001-VenkatasubramanianTA #adaptation #formal method #middleware: A Formal Model for Reasoning about Adaptive QoS-Enabled Middleware (NV, CLT, GA), pp. 197–221.
GT-VMT-2001-FormisanoS #visual notation: An AGG Application Supporting Visual Reasoning (AF, MS), pp. 302–309.
ICEIS-v1-2001-Orchard #fuzzy #tool support: Fuzzy Reasoning in JESS: The Fuzzyj Toolkit and Fuzzyjess (RO), pp. 533–542.
ICEIS-v1-2001-SuarezAGO #constraints #development #programming: Qualitative Reasoning for Software Development Project by Constraint Programming (AJS, PJA, RMG, JAO), pp. 481–488.
MLDM-2001-Perner #classification #question: Are Case-Based Reasoning and Dissimilarity-Based Classification Two Sides of the Same Coin? (PP), pp. 35–51.
MLDM-2001-SchmidtG #abstraction: Temporal Abstractions and Case-Based Reasoning for Medical Course Data: Two Prognostic Applications (RS, LG), pp. 23–34.
SEKE-2001-RamirezA #constraints: Checking Integrity Constraints in Reasoning Systems based on Propositions and Relationships (JR, AdA), pp. 188–195.
TOOLS-EUROPE-2001-Gomez-AlbarranGF #documentation #framework: Profiting from Case-Based Reasoning in Framework Documentation (MGA, PAGC, CFC), pp. 111–122.
ASE-2001-MenziesK #process #re-engineering: Better Reasoning About Software Engineering Activities (TM, JDK), pp. 391–394.
ICSE-2001-EasterbrookC #consistency #framework #multi: A Framework for Multi-Valued Reasoning over Inconsistent Viewpoints (SME, MC), pp. 411–420.
SAC-2001-BandiniM #design #fuzzy #retrieval: Application of fuzzy indexing and retrieval in case based reasoning for design (SB, SM), pp. 462–466.
DAC-2001-KuehlmannGP: Circuit-based Boolean Reasoning (AK, MKG, VP), pp. 232–237.
DATE-2001-EspejoEMO #logic #optimisation: Generalized reasoning scheme for redundancy addition and removal logic optimization (JAE, LE, ESM, EO), pp. 391–397.
TACAS-2001-AmlaENT #composition #diagrams: Assume-Guarantee Based Compositional Reasoning for Synchronous Timing Diagrams (NA, EAE, KSN, RJT), pp. 465–479.
TACAS-2001-Fourman: Propositional Reasoning (MPF), p. 23.
CSL-2001-Koriche #approximate #first-order #logic: A Logic for Approximate First-Order Reasoning (FK), pp. 262–276.
CSL-2001-OHearnRY #data type #source code: Local Reasoning about Programs that Alter Data Structures (PWO, JCR, HY), pp. 1–19.
ICLP-2001-MedinaOV #abduction #approach #logic #multi: A Multi-adjoint Logic Approach to Abductive Reasoning (JM, MOA, PV), pp. 269–283.
IJCAR-2001-AngerKL #logic programming #semantics #set #source code: NoMoRe : A System for Non-monotonic Reasoning with Logic Programs under Answer Set Semantics (CA, KK, TL), pp. 325–330.
IJCAR-2001-HaarslevMT #logic #modelling #pseudo: Exploiting Pseudo Models for TBox and ABox Reasoning in Expressive Description Logics (VH, RM, AYT), pp. 61–75.
LICS-2001-CookK #higher-order #theorem #using: A Second-Order System for Polytime Reasoning Using Graedel’s Theorem (SAC, AK), pp. 177–186.
ICALP-2000-GhicaM #algol #regular expression #using: Reasoning about Idealized ALGOL Using Regular Languages (DRG, GM), pp. 103–115.
ICALP-2000-MeenakshiR #finite #message passing: Reasoning about Message Passing in Finite State Environments (BM, RR), pp. 487–498.
ICEIS-2000-LiY #comprehension #enterprise #information management #nondeterminism #re-engineering: Code Understanding Through Context-Oriented Uncertainty Reasoning for Enterprise Information System Reengineering (YL, HY), pp. 163–170.
ICPR-v3-2000-Perner #parametricity #segmentation: Controlling the Segmentation Parameters by Case-Based Reasoning (PP), pp. 3975–3978.
KR-2000-AmirM #logic: Partition-Based Logical Reasoning (EA, SAM), pp. 389–400.
KR-2000-BalbianiO: A Model for Reasoning about Topologic Relations between cyclic intervals (PB, AO), pp. 378–385.
KR-2000-EiterL #complexity #knowledge base: Complexity Results for Default Reasoning from Conditional Knowledge Bases (TE, TL), pp. 62–73.
KR-2000-HaarslevM #strict #transitive: Expressive ABox Reasoning with Number Restrictions, Role Hierarchies, and Transitively Closed Roles (VH, RM), pp. 273–284.
KR-2000-HorrocksT #axiom #theory and practice: Reasoning with Axioms: Theory and Practice (IH, ST), pp. 285–296.
KR-2000-IsmailS #problem: Two Problems with Reasoning and Acting in Time (HOI, SCS), pp. 355–365.
KR-2000-MorrisM #complexity #on the: On the complexity of reasoning about repeating events (RAM, PHM), pp. 580–588.
KR-2000-VerberneHT #approximate #constraints #using: Anytime Diagnostic Reasoning using Approximate Boolean Constraint Propagation (AV, FvH, AtT), pp. 323–332.
KR-2000-WolterZ #representation: Spatio-temporal representation and reasoning based on RCC-8 (FW, MZ), pp. 3–14.
AdaEurope-2000-SoundarajanF #exception #object-oriented #using: Exceptions in OO Languages: Using Them and Reasoning about Them (NS, SF), pp. 238–251.
SAIG-2000-Pfenning #staged: Reasoning about Staged Computation (FP), pp. 5–6.
SAC-2000-JurisicaG #image #using: Extending Case-Based Reasoning by Discovering and Using Image Features in IVF (IJ, JIG), pp. 52–59.
ESOP-2000-WellsV #equation: Equational Reasoning for Linking with First-Class Primitive Modules (JBW, RV), pp. 412–428.
FoSSaCS-2000-EngelhardtMM #framework #refinement: A Program Refinement Framework Supporting Reasoning about Knowledge and Time (KE, RvdM, YM), pp. 114–129.
CADE-2000-Farmer #framework: An Infrastructure for Intertheory Reasoning (WMF), pp. 115–131.
CADE-2000-HorrocksST #logic: Reasoning with Individuals for the Description Logic SHIQ (IH, US, ST), pp. 482–496.
CADE-2000-Kammuller #composition: Modular Reasoning in Isabelle (FK), pp. 99–114.
CADE-2000-Kautz #information management #representation #scalability: Scalable Knowledge Representation and Reasoning Systems (HAK), p. 183.
CAV-2000-AnnichiniAB #parametricity: Symbolic Techniques for Parametric Reasoning about Counter and Clock Systems (AA, EA, AB), pp. 419–434.
CAV-2000-KupfermanV #approach #infinity: An Automata-Theoretic Approach to Reasoning about Infinite-State Systems (OK, MYV), pp. 36–52.
CAV-2000-NamjoshiT #composition #on the: On the Competeness of Compositional Reasoning (KSN, RJT), pp. 139–153.
CL-2000-DungS: Default Reasoning with Specificity (PMD, TCS), pp. 792–806.
CL-2000-KhizderTW #logic: Reasoning about Duplicate Elimination with Description Logic (VLK, DT, GEW), pp. 1017–1032.
ICDAR-1999-StuckelbergD #on the #probability #recognition #using: On Musical Score Recognition using Probabilistic Reasoning (MVS, DSD), pp. 115–118.
PODS-1999-HaraD #dependence #functional: Reasoning about Nested Functional Dependencies (CSH, SBD), pp. 91–100.
SIGMOD-1999-Jamil #database #deduction: Belief Reasoning in MLS Deductive Databases (HMJ), pp. 109–120.
IWPC-1999-BurnsteinS #automation #comprehension #fuzzy: An Application of Fuzzy Reasoning to Support Automated Program Comprehension (IB, FS), pp. 66–73.
FM-v2-1999-BackMW #interactive: Reasoning About Interactive Systems (RJB, AM, JvW), pp. 1460–1476.
IFM-1999-ReedSG #deduction #development #formal method #model checking: Deductive Reasoning versus Model Checking: Two Formal Approaches for System Development (JNR, JES, FG), pp. 375–394.
HCI-EI-1999-NtuenP #distributed #evaluation #interactive: Distributed Expert system for Interactive Reasoning and Evaluation (CAN, EHP), pp. 1182–1188.
CAiSE-1999-YiJ #process #representation: Beyond Goal Representation: Checking Goal-Satisfaction by Temporal Reasoning with Business Processes (CHY, PJ), pp. 462–466.
ICEIS-1999-CarvalhoCNKKBGB #heuristic #object-oriented: Expert System Object-Oriented Combining Systematic and Heuristic Reasoning (LFdC, HJTdC, JCN, CAAK, CK, CTB, RZG, VSB), p. 763.
KDD-1999-PellegM #algorithm #geometry: Accelerating Exact k-means Algorithms with Geometric Reasoning (DP, AWM), pp. 277–281.
TOOLS-ASIA-1999-BuehrerL #algebra #ontology: Class Algebra for Ontology Reasoning (DJB, CHL), pp. 2–13.
TOOLS-ASIA-1999-FanXZ #behaviour #inheritance: Reasoning about Inheritance and Cloning Behaviors of Software Agents (XF, DX, GZ), pp. 77–82.
RE-1999-MenziesENW #empirical #multi #requirements: An Empirical Investigation of Multiple Viewpoint Reasoning in Requirements Engineering (TM, SME, BN, SW), p. 100–?.
DATE-1999-BreuerMBFLK #semantics #using: Reasoning about VHDL and VHDL-AMS using Denotational Semantics (PTB, NMM, JPB, RBF, MMLP, CDK), pp. 346–352.
FoSSaCS-1999-Sangiorgi #concurrent #using: Reasoning About Concurrent Systems Using Types (DS), pp. 31–40.
LICS-1999-EmersonT #parametricity: Parametric Quantitative Temporal Reasoning (EAE, RJT), pp. 336–343.
LICS-1999-HalpernF #metric #overview #perspective: Plausibility Measures and Default Reasoning: An Overview (JYH, NF), pp. 130–135.
LICS-1999-HalpernS #infinity: Reasoning about Common Knowledge with Infinitely Many Agents (JYH, RAS), pp. 384–393.
ICALP-1998-Vardi #automaton: Reasoning about The Past with Two-Way Automata (MYV), pp. 628–641.
FLOPS-1998-Tsukada #equation: Type-free Equational Reasoning in the Theeory of Inductively Defined Types (YT), pp. 227–246.
ICFP-1998-Ennals #finite #nondeterminism: Controlled Temporal Non-Determinism for Reasoning with a Machine of Finite Speed (RE), p. 339.
CAiSE-1998-JurisicaN #quality: Building Quality into Case-Based Reasoning Systems (IJ, BAN), pp. 363–380.
ICPR-1998-PinzA #recognition: Qualitative spatial reasoning to infer the camera position in generic object recognition (AP, JPA), pp. 770–773.
ICPR-1998-ShahA #architecture #classification #hybrid #performance: A hybrid architecture for performance reasoning in classification systems (SS, JKA), pp. 326–330.
ICPR-1998-StevensB #multi: Multisensor occlusion reasoning (MRS, JRB), pp. 210–214.
KR-1998-BalbianiCC: A Model for Reasoning about Bidemsional Temporal Relations (PB, JFC, LFdC), pp. 124–130.
KR-1998-GiunchigliaG #locality #modelling #semantics: Local Models Semantics, or Contextual Reasoning = Locality + Compatibility (FG, CG), pp. 282–291.
KR-1998-HaarslevLM #logic: Foundations of Spatioterminological Reasoning with Description Logics (VH, CL, RM), pp. 112–123.
KR-1998-Jaeger #infinity #network #random #relational: Reasoning About Infinite Random Structures with Relational Bayesian Networks (MJ), pp. 570–581.
KR-1998-Kamps #automation #formal method #tool support #using: Formal Theory Building Using Automated Reasoning Tools (JK), pp. 478–487.
KR-1998-Karlsson: Anything Can Happen: On Narratives and Hypothetical Reasoning (LK), pp. 36–47.
KR-1998-Levesque #first-order #knowledge base: A Completeness Result for Reasoning with Incomplete First-Order Knowledge Bases (HJL), pp. 14–23.
KR-1998-Liberatore #on the: On the Compilability of Diagnosis, Planning, Reasoning about Actions, Belief Revision, etc (PL), pp. 144–155.
OOPSLA-1998-JacobsBHB #java: Reasoning about Java Classes (BJ, JvdB, MH, MvB), pp. 329–340.
TOOLS-USA-1998-SoundarajanF #behaviour #polymorphism: Reasoning About Polymorphic Behavior (NS, SF), p. 346–?.
TOOLS-USA-1998-Wuyts #declarative #object-oriented: Declarative Reasoning about the Structure of Object-Oriented Systems (RW), pp. 112–124.
FSE-1998-GarlanJN: Reasoning about Implicit Invocation (DG, SJ, DN), pp. 209–221.
CADE-1998-Ohlbach #framework #semantics: Combining Hilbert Style and Semantic Reasoning in a Resolution Framework (HJO), pp. 205–219.
CADE-1998-Pfenning #deduction #linear #logic: Reasoning About Deductions in Linear Logic (FP), pp. 1–2.
LICS-1998-Voronkov #automation #semantics #theorem: Herbrand’s Theorem, Automated Reasoning and Semantics Tableaux (AV), pp. 252–263.
FME-1997-DierksD #case study #specification #visual notation: Graphical Specification and Reasoning: Case Study Generalised Railroad Crossing (HD, CD), pp. 20–39.
HCI-SEC-1997-AsiuM #design #theory and practice: The Role of Case-Based Reasoning in Instructional Design: Theory and Practice (BA, MDM), pp. 153–156.
LOPSTR-1997-MomiglianoO #logic programming #source code #towards: Towards a Logic for Reasoning About Logic Programs Transformation (AM, MO), pp. 226–244.
RE-1997-Yu #modelling #requirements #towards: Towards Modeling and Reasoning Support for Early-Phase Requirements Engineering (ESKY), pp. 226–235.
RE-1997-ZowghiO #evolution #framework #logic #modelling #requirements: A Logical Framework for Modeling and Reasoning About the Evolution of Requirements (DZ, RO), p. 247–?.
ASE-1997-Hall #automation #library #using #validation: Reactive System Validation using Automated Reasoning over a Fragment Library (RJH), pp. 299–300.
ESEC-FSE-1997-JahnkeSZ #database #fuzzy #relational #reverse engineering: Generic Fuzzy Reasoning Nets as a Basis for Reverse Engineering Relational Database Applications (JHJ, WS, AZ), pp. 193–210.
TACAS-1997-Boulton: A Tool to Support Formal Reasoning about Computer Languages (RJB), pp. 81–95.
TAPSOFT-1997-EmersonT #approach #automaton: Generalized Quantitative Temporal Reasoning: An Automata Theoretic Approach (EAE, RJT), pp. 189–200.
CADE-1997-BjornerSU #first-order #integration: A Practical Integration of First-Order Reasoning and Decision Procedures (NB, MES, TEU), pp. 101–115.
CADE-1997-Wen-Tsun #automation: The Char-Set Method and Its Applications to Automated Reasoning (WWT), pp. 1–3.
ICLP-1997-LammaMM #constraints #logic programming: Reasoning on Constraints in Constraint Logic Programming (EL, MM, PM), p. 413.
ILPS-1997-BaralS #approximate: Approximate Reasoning about Actions in Presence of Sensing and Incomplete Information (CB, TCS), pp. 387–401.
LICS-1997-Kozen #algebra #complexity #on the: On the Complexity of Reasoning in Kleene Algebra (DK), pp. 195–202.
LICS-1997-McDowellM #higher-order #logic #syntax: A Logic for Reasoning with Higher-Order Abstract Syntax (RM, DM), pp. 434–445.
LICS-1997-ZhangR #complexity: Complexity of Power Default Reasoning (GQZ, WCR), pp. 328–339.
VLDB-1996-BertinoBFS #data access #database: Supporting Periodic Authorizations and Temporal Reasoning in Database Access Control (EB, CB, EF, PS), pp. 472–483.
RTA-1996-Kapur #automation #challenge: Rewrite-Based Automated Reasoning: Challenges Ahead (DK), pp. 1–2.
CAiSE-1996-VescoukisPS #evolution #framework: A Logic-Based Framework for Reasoning Support in Software Evolution (VCV, NP, ES), pp. 44–59.
AKDDM-1996-SimoudisLK #data mining #deduction #induction #mining: Integrating Inductive and Deductive Reasoning for Data Mining (ES, BL, RK), pp. 353–373.
ICPR-1996-PetrouS #fuzzy #network #on the: On the relationship between neural networks and fuzzy reasoning (MP, KRS), pp. 239–243.
ICPR-1996-WestlingD #generative #interactive #performance #recognition: Object recognition by fast hypothesis generation and reasoning about object interactions (MFW, LSD), pp. 148–153.
KDD-1996-KaufmanM #information management #multi: A Method for Reasoning with Structured and Continuous Attributes in the INLEN-2 Multistrategy Knowledge Discovery System (KAK, RSM), pp. 232–237.
KR-1996-AmatiP #logic #question: Is There a Logic of Provability for Nonmonotonic Reasoning? (GA, FP), pp. 493–503.
KR-1996-Bochman: Biconsequence Relations for Nonmonotonic Reasoning (AB), pp. 482–492.
KR-1996-Calvanese #finite #logic: Finite Model Reasoning in Description Logics (DC), pp. 292–303.
KR-1996-CholewinskiMT: Default Reasoning System DeReS (PC, VWM, MT), pp. 518–528.
KR-1996-DungS #approach: An Argumentation-theoretic Approach to Reasoning with Specificity (PMD, TCS), pp. 506–517.
KR-1996-GiacomoL #logic: TBox and ABox Reasoning in Expressive Description Logics (GDG, ML), pp. 316–327.
KR-1996-JonssonG #constraints: Procedural Reasoning in Constraint Satisfaction (AKJ, MLG), pp. 160–171.
KR-1996-LeeG #parallel #relational #transitive: Parallel Transitive Reasoning in Mixed Relational Hierarchies (YL, JG), pp. 576–587.
KR-1996-Leong #multi: Multiple Perspective Reasoning (TYL), pp. 562–573.
KR-1996-MillerS #calculus: Reasoning about Discontinuities in the Event Calculus (RM, MS), pp. 63–74.
KR-1996-VogelT #constraints #inheritance: Psychological Constraints on Plausible Default Inheritance Reasoning (CV, JT), pp. 608–619.
SIGIR-1996-OroumchianO #information retrieval: An Application of Plausible Reasoning to Information Retrieval (FO, RNO), pp. 244–252.
LOPSTR-1996-DungKT #proving #synthesis: Synthesis of Proof Procedures for Default Reasoning (PMD, RAK, FT), pp. 313–324.
ICSE-1996-RomanMP #interactive #mobile: Assertional Reasoning about Pairwise Transient Interactions in Mobile Computing (GCR, PJM, JYP), pp. 155–164.
CADE-1996-SchaubBN #named #prolog #proving #theorem proving: XRay: A Prolog Technology Theorem Prover for Default Reasoning: A System Description (TS, SB, PN), pp. 293–297.
LICS-1996-Pitts #logic: Reasoning about Local Variables with Operationally-Based Logical Relations (AMP), pp. 152–163.
ICDAR-v1-1995-HoriD #analysis #robust: Robust table-form structure analysis based on box-driven reasoning (OH, DSD), pp. 218–221.
CAiSE-1995-DuffyMMM #analysis #automation #framework #requirements #using: A Framework for Requirements Analysis Using Automated Reasoning (DAD, CM, JAM, PM), pp. 68–81.
CIKM-1995-AbdelmotyE #database: A General Method for Spatial Reasoning in Spatial Databases (AIA, BAEG), pp. 312–317.
CIKM-1995-StranieriZ #formal method: Levels of Reasoning as the Basis for a Formalisation of Argumentation (AS, JZ), pp. 333–339.
OOPSLA-1995-StataG #composition #subclass: Modular Reasoning in the Presence of Subclassing (RS, JVG), pp. 200–214.
POPL-1995-EmersonN: Reasoning about Rings (EAE, KSN), pp. 85–94.
SAC-1995-AndersonM #diagrams #heuristic: Developing a heuristic via diagrammatic reasoning (MA, RM), pp. 227–231.
TAPSOFT-1995-AmadioD #higher-order #process: Reasoning about Higher-Order Processes (RMA, MD), pp. 202–216.
TAPSOFT-1995-BertotF #execution #specification: Reasoning with Executable Specifications (YB, RF), pp. 531–545.
CAV-1995-DingelF #abstraction #infinity #model checking #proving #theorem proving #using: Model Checking for Infinite State Systems Using Data Abstraction, Assumption-Commitment Style reasoning and Theorem Proving (JD, TF), pp. 54–69.
ICLP-1995-CholewinskiMMT: Experimenting with Nonmonotonic Reasoning (PC, VWM, AM, MT), pp. 267–281.
ICLP-1995-SakamaI #abduction #deduction: The Effect of Partial Deduction in Abductive Reasoning (CS, KI), pp. 383–397.
LICS-1995-MarekNR #complexity #logic: Complexity of Normal Default Logic and Related Modes of Nonmonotonic Reasoning (VWM, AN, JBR), pp. 178–185.
PODS-1994-GrahneNU #database #string: Reasoning about Strings in Databases (GG, MN, EU), pp. 303–312.
VLDB-1994-SistlaYH #retrieval: Reasoning About Spatial Relationships in Picture Retrieval Systems (APS, CTY, RH), pp. 570–581.
ICALP-1994-FixS #source code: Reasoning about Programs by Exploiting the Environment (LF, FBS), pp. 328–339.
FME-1994-AnlauffJS: An experimental support system for formal mathematical reasoning (MA, SJ, MS), pp. 421–440.
CHI-1994-RiemanLYP94a #architecture #consistency #interface #why: Why is a raven like a writing desk?: lessons in interface consistency and analogical reasoning from two cognitive architectures (JR, CHL, RMY, PGP), pp. 438–444.
CIKM-1994-Johannesson #integration: Linguistic Instruments and Qualitative Reasoning for Schema Integration (PJ), pp. 252–262.
ICML-1994-RachlinKSA #comprehension #towards: Towards a Better Understanding of Memory-based Reasoning Systems (JR, SK, SS, DWA), pp. 242–250.
KDD-1994-SimoudisLK #database #deduction #induction #mining: Integrating Inductive and Deductive Reasoning for Database Mining (ES, BL, RK), pp. 37–48.
KR-1994-BarndenHIS #implementation #nondeterminism: An Integrated Implementation of Simulative, Uncertain and Metaphorical Reasoning about Mental States (JAB, SH, EI, GCS), pp. 27–38.
KR-1994-Ben-EliyahuP #algorithm #modelling #performance: Reasoning with Minimal Models: Efficient Algorithms and Applications (RBE, LP), pp. 39–50.
KR-1994-Bennett #logic: Spatial Reasoning with Propositional Logics (BB), pp. 51–62.
KR-1994-DelgrandeS #approach: A General Approach to Specificity in Default Reasoning (JPD, TS), pp. 146–157.
KR-1994-DuboisP94a #information management #nondeterminism #representation #standard: Non-Standard Theories of Uncertainty in Knowledge Representation and Reasoning (DD, HP), pp. 634–645.
KR-1994-EtzioniGW: Tractable Closed World Reasoning with Updates (OE, KG, DSW), pp. 178–189.
KR-1994-GereviniS #performance: An Efficient Method for Managing Disjunctions in Qualitative Temporal Reasoning (AG, LKS), pp. 214–225.
KR-1994-Hunter: Defeasible Reasoning with Structured Information (AH), pp. 281–292.
KR-1994-Jaeger #logic #probability: Probabilistic Reasoning in Terminological Logics (MJ), pp. 305–316.
KR-1994-Koehler #logic: An Application of Terminological Logics to Case-based Reasoning (JK), pp. 351–362.
KR-1994-KuipersS #logic: Reasoning in Logic about Continuous Systems (BK, BS), pp. 391–402.
KR-1994-Niemela: A Decision Method for Nonmomotonic Reasoning Based on Autoepistemic Reasoning (IN), pp. 473–484.
KR-1994-Schubert #information management #natural language #representation: Exploiting Natural Language for Knowledge Representation and Reasoning (LKS), pp. 650–651.
ALP-1994-Kesner: Reasoning about Layered, Wildcard and Product Patterns (DK), pp. 253–268.
LOPSTR-1994-FlenerP #induction #on the #synthesis #using: On the Use of Inductive Reasoning in Program Synthesis: Prejudice and Prospects (PF, LP), pp. 69–87.
LOPSTR-1994-GiunchigliaC: Introspective Metatheoretic Reasoning (FG, AC), pp. 425–439.
LOPSTR-1994-Treur #architecture #semantics: Temporal Semantics of Meta-Level Architectures for Dynamic Control of Reasoning (JT), pp. 353–376.
PLILP-1994-Fruhwirth #constraints #logic programming: Annotated Constraint Logic Programming Applied to Temporal Reasoning (TWF), pp. 230–243.
EDAC-1994-AhmadM #automation #layout #named: AREAL: Automated Reasoning Expert for Analogue Layout (HHA, RJM), p. 659.
CADE-1994-Slaney #automation #finite: The Crisis in Finite Mathematics: Automated Reasoning as Cause and Cure (JKS), pp. 1–13.
CAV-1994-Schubert #hardware #hybrid: A Hybrid Model for Reasoning about Composed Hardware Systems (ETS), pp. 260–272.
LICS-1994-Ben-DavidB #logic: a modal logic for subjective default reasoning (SBD, RBE), pp. 477–486.
FME-1993-Jones #design: Reasoning about Interference in an Object-Based Design Method (CBJ), pp. 1–18.
RTA-1993-Matthews #equation #ml #named #standard: MERILL: An Equational Reasoning System in Standard ML (BM), pp. 441–445.
HCI-SHI-1993-Boase-JelinekM: Role of Analogical Reasoning as a Tool for Training (DMBJ, DM), pp. 760–765.
HCI-SHI-1993-SharitC #rule-based #using: The Use of Expert Systems for Training Humans in Rule-Based Reasoning (JS, SC), pp. 819–824.
CIKM-1993-HaasAO #biology #database #information management: Analogical Reasoning for Knowledge Discovery in a Molecular Biology Database (JH, JSA, GCO), pp. 554–564.
SEKE-1993-DojatS: Temporal Reasoning in a Medical Expertise (MD, CS), pp. 134–141.
POPL-1993-ReickeS #algebra: Algebraic Reasoning and Completeness in Typed Languages (JGR, RS), pp. 185–195.
WSA-1993-KatoSI #abduction #performance #program analysis: An Efficient Abductive Reasoning System Based on Program Analysis (SK, HS, HI), pp. 230–241.
STOC-1993-AlurHV #parametricity #realtime: Parametric real-time reasoning (RA, TAH, MYV), pp. 592–601.
TAPSOFT-1993-Kirkwood #automation #equation #implementation #using: Automating (Specififation = Implementation) Using Equational Reasoning and LOTOS (CK), pp. 544–558.
ICLP-1993-KraanBB #logic programming #synthesis: Middle-Out Reasoning for Logic Program Synthesis (IK, DAB, AB), pp. 441–455.
ICLP-1993-PereiraA #semantics: Optative Reasoning with Scenario Semantics (LMP, JJA), pp. 601–615.
ICLP-1993-PintoR #calculus #logic programming: Temporal Reasoning in Logic Programming: A Case for the Situation Calculus (JP, RR), pp. 203–221.
ILPS-1993-LifschitzMT #approach #automation #logic programming: Automated Reasoning About Actions: A Logic Programming Approach (VL, NM, HT), p. 641.
ILPS-1993-Meyer #logic #towards #visual notation: Logic and the Structure of Space — Towards a Visual Logic for Spatial Reasoning (BM), p. 674.
ILPS-1993-RodriguesL #information retrieval: Temporal Reasoning for Temporal Information Retrieval From Text (IPR, JGL), p. 675.
LFP-1992-SabryF #continuation #source code: Reasoning About Programs in Continuation-Passing Style (AS, MF), pp. 288–298.
CHI-1992-OsbornA #interactive #interface #visualisation: An Interface for Interactive Spatial Reasoning and Visualization (JRO, AMA), pp. 75–82.
CAiSE-1992-CostalO #concept #deduction #information management #modelling: A Method for Reasoning About Deductive Conceptual Models of Information Systems (DC, AO), pp. 612–631.
KR-1992-CordierS: A Temporal Revision Model for Reasoning about World Change (MOC, PS), pp. 732–739.
KR-1992-GoldszmidtP #approach: Rank-based Systems: A Simple Approach to Belief Revision, Belief Update, and Reasoning about Evidence and Actions (MG, JP), pp. 661–672.
KR-1992-KollerH #approximate #logic: A Logic for Approximate Reasoning (DK, JYH), pp. 153–164.
KR-1992-Konolige #using: Using Default and Causal Reasoning in Diagnosis (KK), pp. 509–520.
KR-1992-LifschitzW #set: Answer Sets in General Nonmonotonic Reasoning (VL, TYCW), pp. 603–614.
KR-1992-McCartyM: Reasoning About Indefinite Actions (LTM, RvdM), pp. 59–70.
KR-1992-MyersK: Reasoning with Analogical Representations (KLM, KK), pp. 189–200.
KR-1992-Nayak #order #using: Order of Magnitude Reasoning using Logarithms (PPN), pp. 201–210.
KR-1992-NiemelaR #complexity #on the: On the Impact of Stratification on the Complexity of Nonmonotonic Reasoning (IN, JR), pp. 627–638.
KR-1992-PinkasL #consistency #nondeterminism #taxonomy: Reasoning from Inconsistency: A Taxonomy of Principles for Resolving Conflict (GP, RPL), pp. 709–719.
KR-1992-Reiter #research #what: Twelve Years of Nonmonotonic Reasoning Research: Where (and What) Is the Beef (RR), p. 789.
KR-1992-SchragBC: Managing Disjunction for Practical Temporal Reasoning (RS, MB, JC), pp. 36–46.
KR-1992-SkinnerL #architecture #paradigm: An Architecture for Integrating Reasoning Paradigms (JMS, GFL), pp. 753–761.
KR-1992-WeidaL #constraints #network #recognition: Terminological Reasoning with Constraint Networks and an Application to Plan Recognition (RAW, DJL), pp. 282–293.
SIGIR-1992-MasandLW #memory management #using: Classifying News Stories using Memory Based Reasoning (BMM, GL, DLW), pp. 59–65.
ECOOP-1992-LanoH #object-oriented #refinement #specification: Reasoning and Refinement in Object-Oriented Specification Languages (KL, HPH), pp. 78–97.
WSA-1992-Araragi #program transformation: Program Transformation in a Nonmonotonic Reasoning System (TA), pp. 135–143.
CADE-1992-HeskethBS #recursion #source code #synthesis #using: Using Middle-Out Reasoning to Control the Synthesis of Tail-Recursive Programs (JH, AB, AS), pp. 310–324.
CADE-1992-Wos #automation #logic: The Impossibility of the Automation of Logical Reasoning (LW), pp. 1–3.
CAV-1992-WrightL #algorithm #concurrent #proving #theorem proving #using: Using a Theorem Prover for Reasoning about Concurrent Algorithms (JvW, TL), pp. 56–68.
CSL-1992-Gavilanes-FrancoLR #higher-order: Reasoning with Higher Order Partial Functions (AGF, FLC, MRA), pp. 167–181.
JICSLP-1992-MamedeM #logic programming #taxonomy: A Contraint Logic Programming Scheme for Taxonomic Reasoning (MM, LM), pp. 255–269.
LICS-1992-MasonT: References, Local Variables and Operational Reasoning (IAM, CLT), pp. 186–197.
HT-1991-Parunak #hypermedia #set #taxonomy: Don’t Link Me In: Set Based Hypermedia for Taxonomic Reasoning (HVDP), pp. 233–242.
SIGMOD-1991-GuntzerKT #database #deduction #nondeterminism: New Directions For Uncertainty Reasoning In Deductive Databases (UG, WK, HT), pp. 178–187.
VDME-1991-BicarreguiR #using: Reasoning about VDM Developments using the VDM Support Tool in MURAL (JB, BR), pp. 371–388.
VDME-1991-Elvang-Goransson #specification: Reasoning about VDM Specifications (MEG), pp. 343–355.
FPCA-1991-LeungM #lazy evaluation: Reasoning about Simple and Exhaustive Demand in Highter-Order Lazy Languages (AL, PM), pp. 328–351.
CHI-1991-Furnas #comprehension #interface #modelling #visual notation: New graphical reasoning models for understanding graphical interfaces (GWF), pp. 71–78.
KR-1991-Allen: Planning as Temporal Reasoning (JFA), pp. 3–14.
KR-1991-Amsterdam: Temporal Reasoning and Narrative Conventions (JA), pp. 15–21.
KR-1991-DevanbuL: Plan-Based Terminological Reasoning (PTD, DJL), pp. 128–138.
KR-1991-DierbachC: A Formal Basis for Analogical Reasoning (CD, DLC), pp. 139–150.
KR-1991-DuboisP: Conditional Objects and Non-Monontonic Reasoning (DD, HP), pp. 175–185.
KR-1991-Ginsberg: Computational Considerations in Reasoning about Action (MLG), pp. 250–261.
KR-1991-Ginsberg91a: The Computational Value of Nonmonotonic Reasoning (MLG), pp. 262–268.
KR-1991-Kaufman #formal method: A Formal Theory of Spatial Reasoning (SGK), pp. 347–356.
KR-1991-Nebel: Belief Revision and Default Reasoning: Syntax-Based Approaches (BN), pp. 417–428.
KR-1991-Rich #information management #question #representation: Implemented Knowledge Representation and Reasoning Systems: An Endangered Species? (CR), pp. 591–592.
KR-1991-Vreeswijk: The Feasibility of Defeat in Defeasible Reasoning (GV), pp. 526–534.
PLDI-1991-KishonHC #execution #framework #implementation #monitoring #semantics #specification: Monitoring Semantics: A Formal Framework for Specifying, Implementing, and Reasoning about Execution Monitors (AK, PH, CC), pp. 338–352.
ICLP-1991-PereiraAA #semantics: Nonmonotonic Reasoning with Well Founded Semantics (LMP, JNA, JJA), pp. 475–489.
ISLP-1991-Benthem #logic #programming: Reasoning and Programming: Analogies between Logic and Computation (JvB), pp. 717–718.
ISLP-1991-PereiraAA: Counterfactual Reasoning Based on Revising Assumptions (LMP, JNA, JJA), pp. 566–577.
ISLP-1991-Przymusinski #logic programming: Non-Monotonic Reasoning and Logic Programming (TCP), pp. 735–736.
SIGMOD-1990-ChrysanthisR #behaviour #framework #named #specification #transaction: ACTA: A Framework for Specifying and Reasoning about Transaction Structure and Behavior (PKC, KR), pp. 194–203.
LFP-1990-SitaramF #abstraction #continuation #modelling: Reasoning with Continuations II: Full Abstraction for Models of Control (DS, MF), pp. 161–175.
OOPSLA-ECOOP-1990-LeavensW #object-oriented #source code #type system: Reasoning about Object-Oriented Programs that Use Subtypes (GTL, WEW), pp. 212–223.
PLILP-1990-MasonT #source code: Reasoning About Programs with Effects (IAM, CLT), pp. 189–203.
CADE-1990-Bundy: A Science of Reasoning: Extended Abstract (AB), pp. 633–640.
CADE-1990-MullerBNNS #concept #representation #tutorial: Tutorial on Reasoning and Representation with Concept Languages (JM, FB, BN, WN, GS), p. 681.
CADE-1990-WosWMOLSB #automation #logic: Automated Reasoning Contributed to Mathematics and Logic (LW, SW, WM, RAO, ELL, RLS, RB), pp. 485–499.
CAV-1990-EmersonMSS: Quantitative Temporal Reasoning (EAE, AKM, APS, JS), pp. 136–145.
LICS-1990-HarelRV #bound #concurrent #on the #power of #source code: On the Power of Bounded Concurrency~III: Reasoning About Programs (DH, RR, MYV), pp. 478–488.
NACLP-1990-JourdanV #constraints #logic programming: Constraint Logic Programming Applied to Hypothetical Reasoning in Chemistry (JJ, REVP), pp. 154–172.
NACLP-1990-NaqviR #consistency #database: Reasoning in Inconsistent Databases (SAN, FR), pp. 255–272.
SIGMOD-1989-KiferL #higher-order #inheritance #named: F-Logic: A Higher-Order language for Reasoning about Objects, Inheritance, and Scheme (MK, GL), pp. 134–146.
CHI-1989-Cole #comprehension #visual notation: Understanding Bayesian reasoning via graphical displays (WGC), pp. 381–386.
KR-1989-BorgidaE #knowledge base #performance: Hierarchical Knowledge Bases and Efficient Disjunctive Reasoning (AB, DWE), pp. 33–43.
KR-1989-Cohn #framework #hybrid #on the: On the Appearance of Sortal Literals: a Non Substitutional Framework for Hybrid Reasoning (AGC), pp. 55–66.
KR-1989-EtheringtonFGIL: Critical Issues in Nonmonotonic Reasoning (DWE, KDF, MLG, DJI, VL), pp. 500–504.
KR-1989-Frisch #deduction #framework #hybrid: A General Framework for Sorted Deduction: Fundamental Results on Hybrid Reasoning (AMF), pp. 126–136.
KR-1989-Geffner: Default Reasoning, Minimality and Coherence (HG), pp. 137–148.
KR-1989-KotonC #exception #information management #representation: Knowledge Representation in a Case-Based Reasoning System: Defaults and Exceptions (PK, MPC), pp. 203–211.
KR-1989-LinS: Argument Systems: A Uniform Basis for Nonmonotonic Reasoning (FL, YS), pp. 245–255.
KR-1989-Pearl #overview #probability #semantics: Probabilistic Semantics for Nonmonotonic Reasoning: A Survey (JP), pp. 505–516.
KR-1989-Poole #what: What the Lottery Paradox Tells Us About Default Reasoning (DP), pp. 333–340.
KR-1989-Prescott: Analogical Reasoning, Defeasible Reasoning, and the Reference Class (RP), pp. 256–265.
KR-1989-Przymusinski #formal method #logic programming: Three-Valued Formalizations of Non-Monotonic Reasoning and Logic Programming (TCP), pp. 341–348.
KR-1989-RajasekarLM #source code: Skeptical Reasoning and Disjunctive Programs (AR, JL, JM), pp. 349–356.
KR-1989-Stabler #information management #representation #similarity: Syntactic Equality in Knowledge Representation and Reasoning (EPSJ), pp. 459–466.
ML-1989-Redmond #learning: Combining Case-Based Reasoning, Explanation-Based Learning, and Learning form Instruction (MR), pp. 20–22.
PLDI-1989-JouvelotG #continuation: Reasoning about Continuations with Control Effects (PJ, DKG), pp. 218–226.
POPL-1989-EmersonSS #performance: Efficient Temporal Reasoning (EAE, TS, JS), pp. 166–178.
LICS-1989-KiferL #consistency #logic #named #nondeterminism: RI: A Logic for Reasoning with Inconsistency (MK, ELL), pp. 253–262.
LICS-1989-Lifschitz: The Mathematics of Nonmonotonic Reasoning (VL), p. 242.
LICS-1989-Vardi #complexity #on the: On the Complexity of Epistemic Reasoning (MYV), pp. 243–252.
TAV-1989-RazoukG #logic #realtime #source code: Real-Time Interval Logic for Reasoning about Executions of Real-Time Programs (RRR, MMG), pp. 10–19.
SIGMOD-1988-ChenG #implementation: An Implementation Model for Reasoning with Complex Objects (QC, GG), pp. 164–172.
VDME-1988-JonesL #requirements: A Support System for Formal Reasoning: Requirements and Status (CBJ, PAL), pp. 139–152.
ML-1988-Hirsh #learning: Reasoning about Operationality for Explanation-Based Learning (HH), pp. 214–220.
ALP-1988-LiuL #fuzzy #horn clause: Fuzzy Reasoning Based on F-Horn Clause Rules (DL, DL), pp. 214–222.
POPL-1988-GarlandG #data type #induction: Inductive Methods for Reasoning about Abstract Data Types (SJG, JVG), pp. 219–228.
STOC-1988-HalpernV: Reasoning about Knowledge and Time in Asynchronous Systems (JYH, MYV), pp. 53–65.
CADE-1988-Basin #automation: An Environment For Automated Reasoning About Partial Functions (DAB), pp. 101–110.
CADE-1988-BesnardS #automation #logic: Supposition-Based Logic for Automated Nonmontonic Reasoning (PB, PS), pp. 592–601.
CADE-1988-BlasiusS #equation #graph #unification: Partial Unification for Graph Based Equational Reasoning (KHB, JHS), pp. 397–414.
CADE-1988-BrockCP #proving: Analogical Reasoning and Proof Discovery (BB, SC, WP), pp. 454–468.
CADE-1988-BrownPP #automation #named: ZPLAN: An Automatic Reasoning System for Situations (FMB, SSP, JP), pp. 758–759.
CADE-1988-Kafl #linear: Reasoning about Systems of Linear Inequalities (TK), pp. 563–572.
CADE-1988-SubrahmanianU #approximate #consistency #named: QUANTLOG: A System for Approximate Reasoning in Inconsistent Formal Systems (VSS, ZDU), pp. 746–747.
CADE-1988-Wang: Elements of Z-Module Reasoning (TCW), pp. 21–40.
JICSCP-1988-ElkanM88 #automation #induction #logic programming #source code: Automated Inductive Reasoning about Logic Programs (CE, DAM), pp. 876–892.
LICS-1988-FaginHM #logic: A Logic for Reasoning about Probabilities (RF, JYH, NM), pp. 410–421.
HCI-CE-1987-Owen: Direct Manipulation and Procedural Reasoning (DO), pp. 349–356.
CSL-1987-Rasiowa #approximate #logic: Logic of Approximation Reasoning (HR), pp. 188–210.
LICS-1987-SistlaG #process: Reasoning with Many Processes (APS, SMG), pp. 138–152.
DAC-1986-BapatV #logic #using: Reasoning about digital systems using temporal logic (SB, GV), pp. 215–219.
STOC-1986-CourcoubetisVW #concurrent #source code: Reasoning about Fair Concurrent Programs (CC, MYV, PW), pp. 283–294.
STOC-1986-HalpernV #complexity: The Complexity of Reasoning about Knowledge and Time: Extended Abstract (JYH, MYV), pp. 304–315.
CADE-1986-Brown: A Commonsense Theory of Nonmonotonic Reasoning (FMB), pp. 209–228.
CADE-1986-DickC #automation #empirical #equation #using: Using Narrowing to do Isolation in Symbolic Equation Solving — An Experiment in Automated Reasoning (AJJD, JC), pp. 272–280.
CADE-1986-Kafl #linear #verification: Program Verifier “Tatzelwurm”: Reasoning about Systems of Linear Inequalities (TK), pp. 300–305.
ICLP-1986-GoebelFP86 #approach #constraints #using: Using Definite Clauses and Integrity Constraints as the Basis for a Theory Formation Approach to Diagnostic Reasoning (RG, KF, DP), pp. 211–222.
LICS-1986-FelleisenFKD #continuation: Reasoning with Continuations (MF, DPF, EEK, BFD), pp. 131–141.
LICS-1986-KapurM #induction #specification: Inductive Reasoning with Incomplete Specifications (DK, DRM), pp. 367–377.
VLDB-1985-SheardS #automation #complexity #database: Coping with Complexity in Automated Reasoning about Database Systems (TS, DWS), pp. 426–435.
POPL-1985-Leivant #imperative #logic #source code: Logical and Mathematical Reasoning about Imperative Programs (DL), pp. 132–140.
CSE-1985-HsiangS #data type #prolog: A PROLOG Environment for Developing and Reasoning about Data Types (JH, MKS), pp. 276–293.
DAC-1984-WojcikKS #automation #design #verification: A formal design verification system based on an automated reasoning system (ASW, JKJ, NCES), pp. 641–647.
CADE-1984-LuskO #automation #research: A Portable Environment for Research in Automated Reasoning (ELL, RAO), pp. 43–52.
CADE-1984-Schmidt #programming: A Programming Notation for Tactical Reasoning (DAS), pp. 445–459.
ICALP-1983-LehmannS: Reasoning with Time and Chance (DJL, SS), pp. 445–457.
POPL-1983-Lamport: Reasoning About Nonatomic Operations (LL), pp. 28–37.
ICSE-1982-Bauer #specification: From Specifications to Machine Code: Program Construction through Formal Reasoning (FLB), pp. 84–93.
CADE-1980-AielloW #algebra #using: Using Meta-Theoretic Reasoning to do Algebra (LCA, RWW), pp. 1–13.
CADE-1980-Friedman: Reasoning by Plausible Inference (LF), pp. 126–142.
POPL-1978-Oppen #data type #recursion: Reasoning about Recursively Defined Data Structures (DCO), pp. 151–157.
ICALP-1976-Kroger #logic #source code: Logical Rules of Natural Reasoning about Programs (FK), pp. 87–98.
ICALP-1976-Schwarz #proving #source code #termination: Event Based Reasoning — A System for Proving Correct Termination of Programs (JS), pp. 131–146.
POPL-1973-WaldingerL #source code: Reasoning About Programs (RJW, KNL), pp. 169–182.