Tag #deduction
324 papers:
- POPL-2020-ClochardMP #monitoring #verification
- Deductive verification with ghost monitors (MC, CM, AP), p. 26.
- VMCAI-2019-BouillaguetBSY #analysis #in memory #memory management #modelling #pointer #verification
- Exploiting Pointer Analysis in Memory Models for Deductive Verification (QB, FB, MS, BY), pp. 160–182.
- AIIDE-2018-EgerM #comparison #game studies #social
- Keeping the Story Straight: A Comparison of Commitment Strategies for a Social Deduction Game (ME, CM), pp. 24–30.
- LOPSTR-2018-NysS #compilation
- Compiling Control as Offline Partial Deduction (VN, DDS), pp. 115–131.
- PLDI-2018-TaubeLMPSSWW #composition #decidability #distributed #verification
- Modularity for decidability of deductive verification with applications to distributed systems (MT, GL, KLM, OP, MS, SS, JRW, DW), pp. 662–677.
- SAS-2018-McMillanP #decidability #verification
- Deductive Verification in Decidable Fragments with Ivy (KLM, OP), pp. 43–55.
- ESOP-2018-GueneauCP #complexity #formal method #verification
- A Fistful of Dollars: Formalizing Asymptotic Complexity Claims via Deductive Program Verification (AG, AC, FP), pp. 533–560.
- FSCD-2017-KesnerV
- Types as Resources for Classical Natural Deduction (DK, PV), p. 17.
- FASE-2017-ChengT #approach #atl #fault #locality #model transformation
- A Deductive Approach for Fault Localization in ATL Model Transformations (ZC, MT), pp. 300–317.
- ICST-2017-ChengT #incremental #model transformation #relational #verification
- Incremental Deductive Verification for Relational Model Transformations (ZC, MT), pp. 379–389.
- ICSME-2016-LeLLG #automation #program repair #verification
- Enhancing Automated Program Repair with Deductive Verification (XBDL, QLL, DL0, CLG), pp. 428–432.
- FSCD-2016-Huet #education #formal method #functional #programming #type system
- Teaching Foundations of Computation and Deduction Through Literate Functional Programming and Type Theory Formalization (GPH), p. 2.
- POPL-2015-DelawarePGC #data type #named #proving #synthesis
- Fiat: Deductive Synthesis of Abstract Data Types in a Proof Assistant (BD, CPC, JG, AC), pp. 689–700.
- CADE-2015-DinBH #concurrent #modelling #named #verification
- KeY-ABS: A Deductive Verification Tool for the Concurrent Modelling Language ABS (CCD, RB, RH), pp. 517–526.
- CADE-2015-DSilvaU #abstract interpretation #automation
- Abstract Interpretation as Automated Deduction (VD, CU), pp. 450–464.
- CADE-2015-Ji #model checking
- CTL Model Checking in Deduction Modulo (KJ), pp. 295–310.
- CADE-2015-Plaisted #automation #first-order
- History and Prospects for First-Order Automated Deduction (DAP), pp. 3–28.
- CAV-2015-KneussKK #program repair
- Deductive Program Repair (EK, MK, VK), pp. 217–233.
- CAV-2015-VijayaraghavanC #composition #design #hardware #multi #verification
- Modular Deductive Verification of Multiprocessor Hardware Designs (MV, AC, A, ND), pp. 109–127.
- ICLP-2015-Nys #roadmap
- Advances in Analyzing Coroutines by Abstract Conjunctive Partial Deduction (VN), pp. 348–357.
- LICS-2015-BeckmannP
- Hyper Natural Deduction (AB, NP), pp. 547–558.
- TAP-2015-GenestierGP #array #generative #verification
- Sequential Generation of Structured Arrays and Its Deductive Verification (RG, AG, GP), pp. 109–128.
- JCDL-2014-AkbarSFF #education #library #network #recommendation #social
- Recommendation based on Deduced Social Networks in an educational digital library (MA, CAS, WF, EAF), pp. 29–38.
- CIG-2014-YamamotoMCT #algorithm #game studies #nearest neighbour #using
- Deduction of fighting-game countermeasures using the k-nearest neighbor algorithm and a game simulator (KY, SM, CYC, RT), pp. 1–5.
- LCT-NLE-2014-PaisT #first-order #logic #novel #proving
- Novel Didactic Proof Assistant for First-Order Logic Natural Deduction (JP, AT), pp. 441–451.
- LOPSTR-2014-SchreyeNN #compilation
- Analysing and Compiling Coroutines with Abstract Conjunctive Partial Deduction (DDS, VN, CJN), pp. 21–38.
- SAC-2014-PereiraS #complexity #source code
- Complexity checking of ARM programs, by deduction (MP, SMdS), pp. 1309–1314.
- TAP-2014-PetiotKGJ #generative #how #specification #testing #verification
- How Test Generation Helps Software Specification and Deductive Verification in Frama-C (GP, NK, AG, JJ), pp. 204–211.
- IFM-2013-GavaFG #algorithm #verification
- Deductive Verification of State-Space Algorithms (FG, JF, MG), pp. 124–138.
- SEFM-2013-JiHB #execution #program transformation #symbolic computation
- Program Transformation Based on Symbolic Execution and Deduction (RJ, RH, RB), pp. 289–304.
- CIG-2013-Browne13a #logic
- Deductive search for logic puzzles (CB), pp. 1–8.
- CADE-2013-Comon-LundhCS
- Tractable Inference Systems: An Extension with a Deducibility Predicate (HCL, VC, GS), pp. 91–108.
- JCDL-2012-AkbarSF #education #library #network #social
- Deduced social networks for an educational digital library (MA, CAS, EAF), pp. 43–46.
- GPCE-2012-ThumSHA #product line #verification
- Family-based deductive verification of software product lines (TT, IS, MH, SA), pp. 11–20.
- DAC-2012-Seshia #induction #named #synthesis #verification
- Sciduction: combining induction, deduction, and structure for verification and synthesis (SAS), pp. 356–365.
- IJCAR-2012-JacquelBDD #automation #modulo theories #proving #theorem proving #using #verification
- Tableaux Modulo Theories Using Superdeduction — An Application to the Verification of B Proof Rules with the Zenon Automated Theorem Prover (MJ, KB, DD, CD), pp. 332–338.
- LICS-2012-BaeldeN #fixpoint #logic
- Combining Deduction Modulo and Logics of Fixed-Point Definitions (DB, GN), pp. 105–114.
- RTA-2011-ConchinhaBC #equivalence #named #performance
- FAST: An Efficient Decision Procedure for Deduction and Static Equivalence (BC, DAB, CC), pp. 11–20.
- TLCA-2011-BrunelHH #algebra #orthogonal
- Orthogonality and Boolean Algebras for Deduction Modulo (AB, OH, CH), pp. 76–90.
- CADE-2011-Burel
- Experimenting with Deduction Modulo (GB), pp. 162–176.
- CSL-2010-Burel #proving
- Embedding Deduction Modulo into a Prover (GB), pp. 155–169.
- CSL-2010-OHearn #abduction #induction #reasoning
- Abductive, Inductive and Deductive Reasoning about Resources (PWO), pp. 49–50.
- CSL-2010-Santo #canonical #towards
- Towards a Canonical Classical Natural Deduction System (JES), pp. 290–304.
- IJCAR-2010-PientkaD #framework #named #programming #reasoning
- Beluga: A Framework for Programming and Reasoning with Deductive Systems (BP, JD), pp. 15–21.
- TLCA-2009-FioreH #equation #synthesis
- Mathematical Synthesis of Equational Deduction Systems (MPF, CKH), pp. 1–2.
- TLCA-2009-HerbelinZ #call-by #λ-calculus
- An Operational Account of Call-by-Value Minimal and Classical λ-Calculus in “Natural Deduction” Form (HH, SZ), pp. 142–156.
- SEKE-2009-LudwigTA #analysis #concept #database #performance #reasoning #semantics #web
- Performance Analysis of a Deductive Database with a Semantic Web Reasoning Engine: ConceptBase and Racer (SAL, CT, KA), pp. 688–693.
- PPDP-2009-Aranda-LopezNSS #constraints #database #fixpoint #implementation #semantics
- Implementing a fixed point semantics for a constraint deductive database based on hereditary harrop formulas (GAL, SN, FSP, JSH), pp. 117–128.
- FLOPS-2008-NievaSS #constraints #database #formal method
- Formalizing a Constraint Deductive Database Language Based on Hereditary Harrop Formulas with Negation (SN, JSH, FSP), pp. 289–304.
- KR-2008-MagnussonD #induction
- Deductive Planning with Inductive Loops (MM, PD), pp. 528–534.
- IJCAR-2008-Schack-NielsenS #concurrent #framework #logic #named
- Celf — A Logical Framework for Deductive and Concurrent Systems (ASN, CS), pp. 320–326.
- LICS-2008-Burel #first-order #representation #type system #using
- A First-Order Representation of Pure Type Systems Using Superdeduction (GB), pp. 253–263.
- LATA-2007-Komendantskaya #first-order #network
- First-order deduction in neural networks (EK), pp. 307–318.
- SEFM-2007-BeckertK #concurrent #logic #source code #verification
- A Dynamic Logic for Deductive Verification of Concurrent Programs (BB, VK), pp. 141–150.
- SEKE-2007-CostantiniMTT #named
- DALICA: Intelligent Agents for User Profile Deduction (SC, LM, AT, PT), p. 660–?.
- CADE-2007-BeckertGHKRSS #component
- The KeY system 1.0 (Deduction Component) (BB, MG, RH, VK, PR, SS, PHS), pp. 379–384.
- CADE-2007-CouchotL #automation #morphism #polymorphism
- Handling Polymorphism in Automated Deduction (JFC, SL), pp. 263–278.
- CADE-2007-VerchinineLP #automation #proving #verification
- System for Automated Deduction (SAD): A Tool for Proof Verification (KV, AVL, AP), pp. 398–403.
- CAV-2007-FilliatreM #framework #platform #verification #why
- The Why/Krakatoa/Caduceus Platform for Deductive Program Verification (JCF, CM), pp. 173–177.
- CSL-2007-Burel #bound
- Unbounded Proof-Length Speed-Up in Deduction Modulo (GB), pp. 496–511.
- LICS-2007-BraunerHK
- Principles of Superdeduction (PB, CH, CK), pp. 41–50.
- SEFM-2006-BeckertHS #design #object-oriented #verification
- Integrating Object-Oriented Design and Deductive Verification of Software (BB, RH, PHS), p. 260.
- DAC-2006-WangGG #difference #learning #logic
- Predicate learning and selective theory deduction for a difference logic solver (CW, AG, MKG), pp. 235–240.
- CAV-2006-SethiB #c #named
- cascade: C Assertion Checker and Deductive Engine (NS, CB), pp. 166–169.
- ICLP-2006-RamakrishnanRW #logic programming #spreadsheet #using
- Deductive Spreadsheets Using Tabled Logic Programming (CRR, IVR, DSW), pp. 391–405.
- ICLP-2006-Soares #database #implementation #parallel
- Deductive Databases: Implementation, Parallelism and Applications (TS), pp. 467–468.
- RTA-2005-LafourcadeLT #equation #morphism
- Intruder Deduction for AC-Like Equational Theories with Homomorphisms (PL, DL, RT), pp. 308–322.
- ASE-2005-CouchotGK #approach #protocol #safety
- A uniform deductive approach for parameterized protocol safety (JFC, AG, NK), pp. 364–367.
- ASE-2005-Grov #algorithm #approach #correctness #reasoning #source code #verification
- Verifying the correctness of hume programs: an approach combining deductive and algorithmic reasoning (GG), pp. 444–447.
- SAC-2005-Behrend #database #optimisation #query
- Optimizing existential queries in stratifiable deductive databases (AB), pp. 623–628.
- ESOP-2005-LeuschelV #slicing
- Forward Slicing by Conjunctive Partial Deduction and Argument Filtering (ML, GV), pp. 61–76.
- CADE-2005-Steel #api #constraints #modelling #security
- Deduction with XOR Constraints in Security API Modelling (GS), pp. 322–336.
- ICLP-2005-Ferreira #database #using
- The MYDDAS Project: Using a Deductive Database for Traffic Characterization (MF), pp. 424–426.
- ICLP-2005-Mallya #model checking #multi
- Deductive Multi-valued Model Checking (AM), pp. 297–310.
- RTA-2004-GeuversN
- Rewriting for Fitch Style Natural Deductions (HG, RN), pp. 134–154.
- SEFM-2004-BeckertK #proving #reuse #verification
- Proof Reuse for Deductive Program Verification (BB, VK), pp. 77–86.
- UML-2004-AronsHKPZ #modelling #uml #verification
- Deductive Verification of UML Models in TLPVS (TA, JH, HK, AP, MvdZ), pp. 335–349.
- PDCL-2004-LeuschelCBV #using
- Specialising Interpreters Using Offline Partial Deduction (ML, SJC, MB, WV), pp. 340–375.
- CAV-2004-RayH #first-order #pipes and filters #quantifier #using #verification
- Deductive Verification of Pipelined Machines Using First-Order Quantification (SR, WAHJ), pp. 31–43.
- ICLP-2004-RuedaV
- Non-viability Deductions in Arc-Consistency Computation (CR, FDV), pp. 343–355.
- IJCAR-2004-Bonichon #named
- TaMeD: A Tableau Method for Deduction Modulo (RB), pp. 445–459.
- IJCAR-2004-MouraORRS #embedded
- The ICS Decision Procedures for Embedded Deduction (LMdM, SO, HR, JMR, NS), pp. 218–222.
- PODS-2003-Behrend #database #evaluation #query #set
- Soft stratification for magic set based query evaluation in deductive databases (AB), pp. 102–110.
- RTA-2003-Blanqui
- Rewriting Modulo in Deduction Modulo (FB), pp. 395–409.
- CADE-2003-BaumgartnerFGS #interactive #quote #slicing
- “Living Book” :- “Deduction”, “Slicing”, “Interaction” (PB, UF, MGH, AS), pp. 284–288.
- CAV-2003-LahiriB #verification
- Deductive Verification of Advanced Out-of-Order Microprocessors (SKL, REB), pp. 341–353.
- LICS-2003-Comon-LundhS #constraints #theorem proving
- Intruder Deductions, Constraint Solving and Insecurity Decision in Presence of Exclusive or (HCL, VS), p. 271–?.
- SEKE-2002-LoiaSS #named #web
- LearnMiner: deductive, tolerant agents for discovering didactic resources on the web (VL, SS, MIS), pp. 109–115.
- LOPSTR-2002-Gruner
- Abstract Partial Deduction Challenged (SG), pp. 258–259.
- ASE-2002-RoachB #automation #case study #experience #synthesis
- Experience Report on Automated Procedure Construction for Deductive Synthesis (SR, JVB), p. 69–?.
- CADE-2002-Ahrendt #data type #fault #generative #specification #using
- Deductive Search for Errors in Free Data Type Specifications Using Model Generation (WA), pp. 211–225.
- ICLP-2002-Barker #data access #database #logic programming
- Access Control for Deductive Databases by Logic Programming (SB), pp. 54–69.
- ICLP-2002-JamilD #database #multi #semantics
- A Model Theoretic Semantics for Multi-level Secure Deductive Databases (HMJ, GD), pp. 130–147.
- ICLP-2002-LoyerS #database #nondeterminism
- Non-uniform Hypothesis in Deductive Databases with Uncertainty (YL, US), pp. 473–474.
- RTA-2001-Rusinowitch #verification
- Rewriting for Deduction and Verification (MR), p. 2.
- TLCA-2001-Groote #normalisation
- Strong Normalization of Classical Natural Deduction with Disjunction (PdG), pp. 182–196.
- LOPSTR-2001-LeuschelG #model checking #using
- Abstract Conjunctive Partial Deduction Using Regular Types and Its Application to Model Checking (ML, SG), pp. 91–110.
- PADL-2001-Barker #database
- Secure Deductive Databases (SB), pp. 123–137.
- POPL-2001-Ganzinger #performance #program analysis
- Efficient deductive methods for program analysis (HG), pp. 102–103.
- ASE-2001-WhittleBSRPPOLB #estimation #named #synthesis
- Amphion/NAV: Deductive Synthesis of State Estimation Software (JW, JVB, JS, PR, TP, JP, PO, MRL, GPB), pp. 395–399.
- TACAS-2001-PnueliRZ #automation #invariant #verification
- Automatic Deductive Verification with Invisible Invariants (AP, SR, LDZ), pp. 82–97.
- CSL-2001-Rasmussen #logic
- Labelled Natural Deduction for Interval Logics (TMR), pp. 308–323.
- CSL-2001-Rosu #category theory #equation
- Complete Categorical Equational Deduction (GR), pp. 528–538.
- ICLP-2001-Almendros-JimenezBS #database #functional #logic
- A Computational Model for Functional Logic Deductive Databases (JMAJ, ABT, JSH), pp. 331–347.
- IJCAR-2001-Pastre #knowledge-based #proving #theorem proving
- MUSCADET 2.3: A Knowledge-Based Theorem Prover Based on Natural Deduction (DP), pp. 685–689.
- IJCAR-2001-Peltier #automation #using
- A General Method for Using Schematizations in Automated Deduction (NP), pp. 578–592.
- IJCAR-2001-Voronkov #algorithm #automation #performance
- Algorithms, Datastructures, and other Issues in Efficient Automated Deduction (AV), pp. 13–28.
- LICS-2001-GodoyN #constraints #monad #on the
- On Ordering Constraints for Deduction with Built-In Abelian Semigroups, Monoids and Groups (GG, RN), pp. 38–47.
- KR-2000-MontanariPS #automation #first-order #logic
- Supporting automated deduction in first-order modal logics (AM, AP, MS), pp. 547–556.
- PPDP-2000-LeuschelL #petri net #problem
- Solving coverability problems of petri nets by partial deduction (ML, HL), pp. 268–279.
- CADE-2000-Pulman #automation #comprehension #named #natural language #tutorial
- Tutorial: Automated Deduction and Natural Language Understanding (SGP), pp. 509–510.
- CAV-2000-Pnueli #abstraction #composition #explosion #symmetry
- Keynote Address: Abstraction, Composition, Symmetry, and a Little Deduction: The Remedies to State Explosion (AP), p. 1.
- CL-2000-LeuschelL #petri net
- Coverability of Reset Petri Nets and Other Well-Structured Transition Systems by Partial Deduction (ML, HL), pp. 101–115.
- CL-2000-Pliuskevicius #on the #strict
- On an ω-Decidable Deductive Procedure for Non-Horn Sequents of a Restricted FTL (RP), pp. 523–537.
- SIGMOD-1999-Jamil #database #reasoning
- Belief Reasoning in MLS Deductive Databases (HMJ), pp. 109–120.
- FM-v1-1999-KestenKPR #analysis #model checking #verification
- A Perfect Verification: Combining Model Checking with Deductive Analysis to Verify Real-Life Software (YK, AK, AP, GR), pp. 173–194.
- IFM-1999-ReedSG #development #formal method #model checking #reasoning
- Deductive Reasoning versus Model Checking: Two Formal Approaches for System Development (JNR, JES, FG), pp. 375–394.
- RTA-1999-Groote #normalisation #on the
- On the Strong Normalisation of Natural Deduction with Permutation-Conversions (PdG), pp. 45–59.
- TLCA-1999-PolakowP #linear #logic
- Natural Deduction for Intuitionistic Non-communicative Linear Logic (JP, FP), pp. 295–309.
- TOOLS-USA-1999-Liu #database #object-oriented #overview
- Overview of the ROL2 Deductive Object-Oriented Database System (ML), p. 63–?.
- PADL-1999-SiddabathuniDU #object-oriented
- An AQUA-Based Intermediate Language for Evaluating an Active Deductive Object-Oriented Language (BS, SWD, SDU), pp. 164–178.
- ASE-1999-FischerW #integration #retrieval #synthesis
- An Integration of Deductive Retrieval into Deductive Synthesis (BF, JW), p. 52–?.
- ASE-1999-Penix99a #architecture #synthesis
- Deductive Synthesis of Event-Based Software Architectures (JP), pp. 311–314.
- CADE-1999-Groote #approach #programming
- A dynamic programming approach to categorial deduction (PdG), pp. 1–15.
- CADE-1999-Nieuwenhuis #constraints
- Invited Talk: Rewrite-based Deduction and Symbolic Constraints (RN), pp. 302–313.
- CADE-1999-PfenningS #framework #logic
- System Description: Twelf — A Meta-Logical Framework for Deductive Systems (FP, CS), pp. 202–206.
- ICLP-1999-MalletD #database #generative
- Generating Deductive Database Explanations (SM, MD), pp. 154–168.
- ADL-1998-WiesenerHB #database #documentation #hypermedia
- Advanced Hypermedia Indexing of Documents in a Deductive Database System (SW, HH, RB), pp. 98–106.
- CIKM-1998-BellatrecheKL #approach #database #distributed
- An Iterative Approach for Rules and Data Allocation in Distributed Deductive Database Systems (LB, KK, QL), pp. 356–363.
- CIKM-1998-ChunC #database #semantics
- Providing Semantics for Indefinite Deductive Databases (SC, JC), pp. 441–448.
- KR-1998-Lukasiewicz #constraints #probability
- Probabilistic Deduction with Conditional Constraints over Basic Events (TL), pp. 380–393.
- LOPSTR-1998-BaalenR #synthesis #using
- Using Decision Procedures to Accelerate Domain-Specific Deductive Synthesis Systems (JVB, SR), pp. 61–70.
- LOPSTR-1998-MalletD #database #debugging #named #relational
- Myrtle: A Set-Oriented Meta-Interpreter Driven by a “Relational” Trace for Deductive Databases Debugging (SM, MD), pp. 328–330.
- ESOP-1998-BruynoogheLS #analysis
- A Polyvariant Binding-Time Analysis for Off-line Partial Deduction (MB, ML, KFS), pp. 27–41.
- CADE-1998-Malik #automation #finite #source code
- Automated Deduction of Finite-State Control Programs for Reactive Systems (RM), pp. 302–316.
- CADE-1998-Pfenning #linear #logic #reasoning
- Reasoning About Deductions in Linear Logic (FP), pp. 1–2.
- CADE-1998-Pnueli #verification
- Deductive vs. Model-Theoretic Approaches to Formal Verification (AP), p. 301.
- CIKM-1997-Lukasiewicz #knowledge base #performance #probability #taxonomy
- Efficient Global Probabilistic Deduction from Taxonomic and Probabilistic Knowledge-Bases over Conjunctive Events (TL), pp. 75–82.
- ESEC-FSE-1997-AlborghettiGM #analysis #automation
- Providing Automated Support to Deductive Analysis of Time Critical Systems (AA, AG, AM), pp. 211–226.
- SAC-1997-NeumannM #database #distributed #mobile
- Mobile computing within a distributed deductive database (KN, MM), pp. 318–322.
- CADE-1997-NieuwenhuisRV #algorithm #automation #data type #kernel #named #similarity
- Dedan: A Kernel of Data Structures and Algorithms for Automated Deduction with Equality Clauses (RN, JMR, MÁV), pp. 49–52.
- CAV-1997-Saidi #automation #invariant #verification
- The Invariant Checker: Automated Deductive Verification of Reactive Systems (HS), pp. 436–439.
- ICLP-1997-Liu #database #set #tuple
- Supporting Partial and Complete Sets and Tuples in Deductive Databases (ML), p. 415.
- VLDB-1996-LeeL #constraints #database
- Further Improvements on Integrity Constraint Checking for Stratifiable Deductive Databases (SYL, TWL), pp. 495–505.
- FME-1996-HutterLSSSW #verification
- Deduction in the Verification Support Environment (VSE) (DH, BL, CS, JHS, WS, AW), pp. 268–286.
- AKDDM-1996-SimoudisLK #data mining #induction #mining #reasoning
- Integrating Inductive and Deductive Reasoning for Data Mining (ES, BL, RK), pp. 353–373.
- SIGIR-1996-JarvelinKNSK #query
- A Deductive Data Model for Query Expansion (KJ, JK, TN, ES, HK), pp. 235–243.
- LOPSTR-1996-JorgensenLM
- Conjunctive Partial Deduction in Practice (JJ, ML, BM), pp. 59–82.
- LOPSTR-1996-MatskinKK #framework #source code #synthesis
- Partial Deduction in the Framework of Structural Synthesis of Programs (MM, HJK, JK), pp. 239–255.
- LOPSTR-1996-PettorossiPR
- Enhancing Partial Deduction via Unfold/Fold Rules (AP, MP, SR), pp. 146–168.
- PLILP-1996-GluckJMS
- Controlling Conjunctive Partial Deduction (RG, JJ, BM, MHS), pp. 152–166.
- PLILP-1996-Liu #database #programming language
- The LOL Deductive Database Programming Language (ML), pp. 454–468.
- KBSE-1996-EllmanM #algebra #difference #equation #network #simulation #source code #synthesis
- Deductive Synthesis of Numerical Simulation Programs from Networks of Algebraic and Ordinary Differential Equations (TE, TM), p. 5.
- TACAS-1996-AyariB #development
- Generic System Support for Deductive Program Development (AA, DAB), pp. 313–328.
- CADE-1996-LintonMPS #algebra #automation
- Algebra and Automated Deduction (SL, UM, PP, DS), pp. 448–462.
- CADE-1996-Ruess #framework
- Reflection of Formal Tactics in a Deductive Reflection Framework (HR), pp. 628–642.
- CADE-1996-Scott #automation #question #what
- What Can We Hope to Achieve From Automated Deduction? (DSS), p. 245.
- CAV-1996-PnueliS #algorithm #framework #platform #verification
- A Platform for Combining Deductive with Algorithmic Verification (AP, ES), pp. 184–195.
- CAV-1996-Rushby #automation #formal method
- Automated Deduction and Formal Methods (JMR), pp. 169–183.
- CAV-1996-SipmaUM #model checking
- Deductive Model Checking (HS, TEU, ZM), pp. 208–219.
- JICSLP-1996-Bry #composition #database #logic programming #semantics #source code
- A Compositional Semantics for Logic Programs and Deductive Databases (FB), pp. 453–467.
- JICSLP-1996-Decker #abduction #database #maintenance
- An Extension of SLD by Abduction and Integrity Maintenance for View Updating in Deductive Databases (HD), pp. 157–169.
- JICSLP-1996-LeuschelSW #concept #integration #towards
- A Conceptual Embedding of Folding into Partial Deduction: Towards a Maximal Integration (ML, DDS, DAdW), pp. 319–332.
- RTA-1995-AvenhausDF #distributed #equation #named
- DISCOUNT: A SYstem for Distributed Equational Deduction (JA, JD, MF), pp. 397–402.
- CIKM-1995-YoonSP #approach #database #object-oriented #query #semantics #using
- Semantic Query Processing in Object-Oriented Databases Using Deductive Approach (SCY, IYS, EKP), pp. 150–157.
- SEKE-1995-YoonK #database #object-oriented #query #semantics
- Semantic Query Processing in Deductive Object-Oriented Databases (SCY, CSK), pp. 358–365.
- LOPSTR-1995-LauO #logic programming #object-oriented #source code #synthesis #towards
- Towards an Object-Oriented Methodology for Deductive Synthesis of Logic Programs (KKL, MO), pp. 152–169.
- LOPSTR-1995-Leuschel #constraints
- Ecological Partial Deduction: Preserving Characteristic Trees Without Constraints (ML), pp. 1–16.
- LOPSTR-1995-WaalT #problem #program analysis #program transformation #using
- Solving Deductive Planning Problems Using Program Analysis and Transformation (DAdW, MT), pp. 189–203.
- KBSE-1995-Reuss #synthesis #towards #type system
- Towards High-Level Deductive Program Synthesis Based on Type Theory (HR), pp. 174–183.
- TACAS-1995-MullerN #model checking
- Combining Model Checking and Deduction for I/O-Automata (OM, TN), pp. 1–16.
- ICLP-1995-DekhtyarD #behaviour #database
- Dynamic Deductive Data Bases With Steady Behaviour (MID, AJD), pp. 183–197.
- ICLP-1995-MartensG #flexibility #termination
- Ensuring Global Termination of Partial Deduction while Allowing Flexible Polyvariance (BM, JPG), pp. 597–611.
- ICLP-1995-NilssonTW #distributed #memory management #named #query #realtime
- Amnesia — A Distributed Real-Time Primary Memory DBMS with a Deductive Query Language (HN, TT, CW), p. 821.
- ICLP-1995-SakamaI #abduction #reasoning
- The Effect of Partial Deduction in Abductive Reasoning (CS, KI), pp. 383–397.
- ILPS-1995-LauO #approach #constraints #formal method #logic programming #source code #synthesis
- A Formal Approach to Deductive Synthesis of Constraint Logic Programs (KKL, MO), pp. 543–557.
- ILPS-1995-LeuschelM #representation
- Partial Deduction of the Ground Representation and its Application to Integrity Checking (ML, BM), pp. 495–509.
- SIGMOD-1994-SagonasSW #database #performance
- XSB as an Efficient Deductive Database Engine (KFS, TS, DSW), pp. 442–453.
- SIGMOD-1994-SagonasSW94a #database
- XSB as a Deductive Database (KFS, TS, DSW), p. 512.
- VLDB-1994-BarjaPFWD #database #effectiveness #integration #object-oriented
- An Effective Deductive Object-Oriented Database Through Language Integration (MLB, NWP, AAAF, MHW, AD), pp. 463–474.
- VLDB-1994-MohaniaS #database #design #distributed
- Some Issues in Design of Distributed Deductive Databases (MKM, NLS), pp. 60–71.
- CAiSE-1994-SanchoO #concept #information management #modelling #specification #transaction
- Deriving Transaction Specifications from Deductive Conceptual Models of Information Systems (MRS, AO), pp. 311–324.
- CIKM-1994-HanLX #database #named #prototype
- LogicBase: A Deductive Database System Prototype (JH, LL, ZX), pp. 226–233.
- CIKM-1994-YoonSP #database #object-oriented #query
- Intelligent Query Answering in Deductive and Object-Oriented Databases (SCY, IYS, EKP), pp. 244–251.
- KDD-1994-ShenMOZ #database #induction #learning #using
- Using Metagueries to Integrate Inductive Learning and Deductive Database Technology (WMS, BGM, KO, CZ), pp. 335–346.
- KDD-1994-SimoudisLK #database #induction #mining #reasoning
- Integrating Inductive and Deductive Reasoning for Database Mining (ES, BL, RK), pp. 37–48.
- SEKE-1994-BreretonS #evolution #framework
- A deductive infrastructure for exploratory software evolution (PB, PS), pp. 62–69.
- SEKE-1994-Pliuskevicius #specification
- Saturated deductive systems for temporal specifications (RP), pp. 267–273.
- SEKE-1994-SheuY #program transformation
- A deductive program transformation system (PCYS, SBY), pp. 524–531.
- ECOOP-1994-BertinoGM #database
- Deductive Object Databases (EB, GG, DM), pp. 213–235.
- LOPSTR-1994-LauO #framework #logic programming #on the #source code #specification #synthesis
- On Specification Frameworks and Deductive Synthesis of Logic Programs (KKL, MO), pp. 104–121.
- LOPSTR-1994-SakamaS #approach #declarative #logic programming #source code
- Partial Deduction of Disjunctive Logic Programs: A Declarative Approach (CS, HS), pp. 170–182.
- PLILP-1994-GluckS
- Partial Deduction and Driving are Equivalent (RG, MHS), pp. 165–181.
- CADE-1994-Baker #automation
- A New Application for Explanation-Based Generalisation within Automated Deduction (SB), pp. 177–191.
- CADE-1994-HuangKKMNRS94a #automation #named #tool support
- KEIM: A Toolkit for Automated Deduction (XH, MK, MK, EM, DN, JR, JHS), pp. 807–810.
- CADE-1994-Pfenning #metalanguage #named
- Elf: A Meta-Language for Deductive Systems (FP), pp. 811–815.
- CADE-1994-StickelWLPU #composition #library
- Deductive Composition of Astronomical Software from Subroutine Libraries (MES, RJW, MRL, TP, IU), pp. 341–355.
- CADE-1994-Vigneron #commutative #constraints
- Associative-Commutative Deduction with Constraints (LV), pp. 530–544.
- ICLP-1994-DeckerC #database
- A Slick Procedure for Integrity Checking in Deductive Databases (HD, MC), pp. 456–469.
- ICLP-1994-LauOT #logic programming #problem #source code #synthesis
- The Halting Problem for Deductive Synthesis of Logic Programs (KKL, MO, SÅT), pp. 665–683.
- ILPS-1994-DekhtyarD #behaviour #database #on the
- On Stable Behaviour of Dynamic Deductive Data Bases (MID, AJD), p. 677.
- ILPS-1994-LakshmananS #database #probability
- Probabilistic Deductive Databases (LVSL, FS), pp. 254–268.
- SIGMOD-1993-RamakrishnanRSSS #database
- The CORAL Deductive Database System (RR, WGR, PS, DS, SS), pp. 544–545.
- SIGMOD-1993-RamakrishnanSSS #database #implementation
- Implementation of the CORAL Deductive Database System (RR, DS, SS, PS), pp. 167–176.
- SIGMOD-1993-Vieille #database #how #object-oriented #question #why
- A Deductive and Object-Oriented Database System: Why and How? (LV), p. 438.
- VLDB-1993-Plexousakis #constraints #knowledge base #maintenance
- Integrity Constraint and Rule Maintenance in Temporal Deductive Knowledge Bases (DP), pp. 146–157.
- CAiSE-1993-QuerO #concept #interactive #modelling #object-oriented
- Object Interaction in Object-Oriented Deductive Conceptual Models (CQ, AO), pp. 374–396.
- CIKM-1993-Anderson #approach #database #knowledge base #multi #problem #statistics
- A Dynamic Knowledge Based Approach to the Problem of Deduction in a Non-Statistical Multilevel Secure Database (MA), pp. 154–163.
- CIKM-1993-Derr #adaptation #database #optimisation #query
- Adaptive Query Optimization in a Deductive Database System (MAD), pp. 206–215.
- CIKM-1993-Harrison #database
- Active Rules in Deductive Databases (JVH), pp. 174–183.
- CIKM-1993-PetrouniasL #development #evaluation
- Development and Evaluation of an Application in a Deductive Environment (IP, PL), pp. 184–193.
- CIKM-1993-WuS #logic #validation
- Rule Validation Based on Logical Deduction (PW, SYWS), pp. 164–173.
- SEKE-1993-PirriP #datalog #design #taxonomy #using
- Using Datalog as a Language for Data Dictionary Design: A Deductive Support (FP, CP), pp. 304–308.
- LOPSTR-1993-LauO #logic programming #source code #specification #synthesis
- A Formal View of Specification, Deductive Synthesis and Transformation of Logic Programs (KKL, MO), pp. 10–31.
- PEPM-1993-Prestwich #online #scalability #source code
- Online Partial Deduction of Large Programs (SDP), pp. 111–118.
- ICLP-1993-LauO #logic programming #source code #synthesis
- An Incompleteness Result for Deductive Synthesis of Logic Programs (KKL, MO), pp. 456–477.
- ICLP-1993-VaghaniRKSSLH #database
- Status of the Aditi Deductive Database System (JV, KR, DBK, ZS, PJS, TSL, JH), p. 851.
- ILPS-1993-BruningHSTS
- Disjunction In Resource-Oriented Deductive Planning (SB, SH, UCS, MT, JS), p. 670.
- ILPS-1993-DongL #approach #query
- A Deductive Approach to Hypothetical Query Answering (FD, LVSL), pp. 609–628.
- ILPS-1993-WassermanYS #logic programming
- The Essential Inadequacy of Deductions in Logic Programming (HCW, KY, ZS), p. 644.
- PODS-1992-BellNNS #database #implementation #linear #programming
- Implementing Deductive Databases by Linear Programming (CB, AN, RTN, VSS), pp. 283–292.
- PODS-1992-RossS #database
- Monotonic Aggregation in Deductive Databases (KAR, YS), pp. 114–126.
- VLDB-1992-UrpiO #database
- A Method for Change Computation in Deductive Databases (TU, AO), pp. 225–237.
- LFP-1992-NeubergerM #analysis #power of #precise #strict
- A Precise Relationship Between the Deductive Power of Forward and Backward Strictness Analysis (MN, PM), pp. 127–138.
- CAiSE-1992-CostalO #concept #information management #modelling #reasoning
- A Method for Reasoning About Deductive Conceptual Models of Information Systems (DC, AO), pp. 612–631.
- CAiSE-1992-GhoshW #concept #database #framework #graph #object-oriented
- Conceptual Graphs as a Framework for Deductive Object-Oriented Databases (BCG, VW), pp. 147–163.
- KR-1992-Dalal #information management #representation
- Tractable Deduction in Knowledge Representation Systems (MD), pp. 393–402.
- SEKE-1992-KimH #database #evaluation #parallel #recursion
- Network-Based Simple Recursive Answer Evaluation for Deductive Databases in Parallel Environment (KK, LJH), pp. 63–70.
- ALP-1992-AravindanD #logic programming #semantics #source code
- Partial Deduction of Logic Programs wrt Well-Founded Semantics (CA, PMD), pp. 384–402.
- LOPSTR-1992-NardiR #query #source code #synthesis
- Deductive Synthesis of Programs for Query Answering (DN, RR), pp. 15–29.
- CADE-1992-Baker-PlummerBM #automation
- &: Automated Natural Deduction (DBP, SCB, ASM), pp. 716–720.
- CADE-1992-Dafa #automation #proving #theorem proving
- A Natural Deduction Automated Theorem Proving System (LD), pp. 668–672.
- CADE-1992-McCuneW #automation
- Experiments in Automated Deduction with Condensed Detachment (WM, LW), pp. 209–223.
- CADE-1992-PfenningR #implementation
- Implementing the Meta-Theory of Deductive Systems (FP, ER), pp. 537–551.
- CADE-1992-Sutcliffe92a #linear #semantics
- The Semantically Guided Linear Deduction System (GS), pp. 677–680.
- JICSLP-1992-Abiteboul #database #object-oriented
- Deductive and Object-Oriented Databases (SA), pp. 26–29.
- JICSLP-1992-DongL #database
- Deductive Databases with Incomplete Information (FD, LVSL), pp. 303–317.
- PODS-1991-LakshmananH #database #framework #optimisation #query #semantics
- Structural Query Optimization — A uniform Framework for Semantic Query Optimization in Deductive Databases (LVSL, HJH), pp. 102–114.
- PODS-1991-Tsur #database
- Deductive Databases in Action (ST), pp. 142–153.
- SIGMOD-1991-GuntzerKT #database #nondeterminism #reasoning
- New Directions For Uncertainty Reasoning In Deductive Databases (UG, WK, HT), pp. 178–187.
- SIGMOD-1991-LouO #inheritance #named #object-oriented
- LLO: An Object-Oriented Deductive Language with Methods and Method Inheritance (YL, ZMÖ), pp. 198–207.
- SIGMOD-1991-PhippsDR #database #named
- Glue-Nail: A Deductive Database System (GP, MAD, KAR), pp. 308–317.
- SIGMOD-1991-Sheng #database #nondeterminism
- A Non-deterministic Deductive Database Language (YHS), pp. 188–197.
- KR-1991-FrischS #framework
- A General Framework for Modal Deduction (AMF, RBS), pp. 196–207.
- SIGIR-1991-JarvelinN #database #integration #retrieval
- Advanced Retrieval From Heterogeneous Fact Databases: Integration of Data Retrieval, Conversion, Aggregation and Deductive Techniques (KJ, TN), pp. 173–182.
- KBSE-1991-MeggendorferM #retrieval
- A Knowledge and Deduction Based Software Retrieval Tool (SM, PM), pp. 127–133.
- ICLP-1991-FernandezM #bottom-up #database #evaluation
- Bottom-Up Evaluation of Hierarchical Disjunctive Deductive Databases (JAF, JM), pp. 660–675.
- ICLP-1991-NgS #database #framework #semantics
- A Semantical Framework for Supporting Subjective and Conditional Probabilities in Deductive Databases (RTN, VSS), pp. 565–580.
- ISLP-1991-BruynoogheSM #infinity #logic programming #source code
- A General Criterion for Avoiding Infinite Unfolding During Partial Deduction of Logic Programs (MB, DDS, BM), pp. 117–131.
- LICS-1991-BonetB #on the #proving
- On the Deduction Rule and the Number of Proof Lines (MLB, SRB), pp. 286–297.
- PODS-1990-Chomicki #database #polynomial #query
- Polynomial Time Query Processing in Temporal Deductive Databases (JC), pp. 379–391.
- PODS-1990-Saraiya #database #polynomial #program transformation
- Polynomial-Time Program Transformations in Deductive Databases (YPS), pp. 132–144.
- SIGMOD-1990-KiernanMS #database
- Making Deductive Databases a Practical Technology: A Step Forward (GK, CdM, ES), pp. 237–246.
- SIGMOD-1990-Sheng #database #named #power of
- IDLOG: Extending the Expressive Power of Deductive Database Languages (YHS), pp. 54–63.
- SEKE-1990-Bottcher #database #development #programming
- Development and Programming of Deductive Databases with PROTOS-L (SB), pp. 171–176.
- CADE-1990-Bibel #automation
- Perspectives on Automated Deduction (WB), p. 426.
- CADE-1990-LeeH #compilation #database
- Substitution-based Compilation of Extended Rules in Deductive Databases (SHL, LJH), pp. 57–71.
- CADE-1990-PfenningN #symmetry
- Presenting Intuitive Deductions via Symmetric Simplification (FP, DN), pp. 336–350.
- CADE-1990-SlaneyL #automation
- Parallelizing the Closure Computation in Automated Deduction (JKS, ELL), pp. 28–39.
- CADE-1990-Waldinger #tutorial
- Tutorial on Program-Synthetic Deduction (RJW), p. 684.
- CLP-1990-Bry90 #abduction
- Intensional Updates: Abduction via Deduction (FB), pp. 561–575.
- CLP-1990-GriefahnL90 #constraints #database #top-down
- Top-Down Integrity Constraint Checking for Deductive Databases (UG, SL), pp. 130–144.
- CSL-1990-Szabo #automation #on the
- On the Tracking of Loops in Automated Deductions (MES), pp. 366–388.
- NACLP-1990-Przymusinski #database #logic programming #semantics #source code
- Stationary Semantics for Disjunctive Logic Programs and Deductive Databases (TCP), pp. 40–59.
- NACLP-1990-Zaniolo #database #programming
- Deductive Database Systems: Applications and Programming (CZ), pp. 842–845.
- PODS-1989-Manchanda #database #declarative
- Declarative Expression of Deductive Database Updates (SM), pp. 93–100.
- VLDB-1989-BattistaL #modelling
- A Deductive Method for Entity-Relationship Modeling (GDB, ML), pp. 13–21.
- VLDB-1989-Olive #concept #design #implementation #information management #modelling #on the
- On the design and implementation of information systems from deductive conceptual models (AO), pp. 3–11.
- KR-1989-Frisch #framework #hybrid #reasoning
- A General Framework for Sorted Deduction: Fundamental Results on Hybrid Reasoning (AMF), pp. 126–136.
- ML-1989-BergadanoGP #induction #learning #top-down
- Deduction in Top-Down Inductive Learning (FB, AG, SP), pp. 23–25.
- ML-1989-Widmer #integration #learning
- A Tight Integration of Deductive Learning (GW), pp. 11–13.
- CSL-1989-Vogler #database #semantics
- The Semantics of Disjunctive Deductive Databases (HV), pp. 409–421.
- NACLP-1989-KempRBM #constraints #database
- Propagating Constraints in Recusive Deduction Databases (DBK, KR, IB, KM), pp. 981–998.
- PODS-1988-ChomickiI #database #infinity
- Temporal Deductive Databases and Infinite Objects (JC, TI), pp. 61–73.
- PODS-1988-KiferRS #approach #axiom #database #query #safety
- An Axiomatic Approach to Deciding Query Safety in Deductive Databases (MK, RR, AS), pp. 52–60.
- SIGMOD-1988-Vardi #database #logic programming
- Database Logic Programming, Deductive Databases, and Expert Database Systems (MYV), p. 7.
- SIGMOD-1988-YounHH #classification #database #recursion
- Classification of Recursive Formulas in Deductive Databases (CY, LJH, JH), pp. 320–328.
- VLDB-1988-Lozinskii
- Computing Facts in Non-Horn Deductive Systems (ELL), pp. 273–279.
- VLDB-1988-MaindrevilleS #database #modelling #query
- Modelling Non Deterministic Queries and Updates in Deductive Databases (CdM, ES), pp. 395–406.
- VLDB-1988-Sripada #database #framework #logic
- A logical framework for temporal deductive databases (SMS), pp. 171–182.
- SIGIR-1988-Gonzalez-RubioC #database #parallel #relational
- A Parallel Multiprocessor Machine Dedicated to Relational and Deductive Databases (RGR, MC), pp. 417–431.
- CADE-1988-ButlerK #parallel #problem #prototype
- Exploitation of Parallelism in Prototypical Deduction Problems (RB, NTK), pp. 333–343.
- CADE-1988-CerroH #linear
- Linear Modal Deductions (LFdC, AH), pp. 487–499.
- CADE-1988-Stickel #automation
- The KLAUS Automated Deduction System (MES), pp. 750–751.
- JICSCP-1988-FooRTW88
- Deduced Relevant Types and Constructive Negation (NYF, ASR, AT, AW), pp. 126–139.
- PODS-1987-Minker #database
- Perspectives in Deductive Databases (JM), p. 135.
- SIGMOD-1987-AlyO #database #logic #modelling #nondeterminism #query
- Non-deterministic Modelling of Logical Queries in Deductive Databases (HA, ZMÖ), pp. 60–72.
- VLDB-1987-KowalskiSS #database
- Integrity Checking in Deductive Databases (RAK, FS, PS), pp. 61–69.
- DAC-1987-Subrahmanyam #named
- LCS — A Leaf Cell Synthesizer Employing Formal Deduction Techniques (PAS), pp. 459–465.
- CSL-1987-BryM #database #finite #proving #satisfiability
- Proving Finite Satisfiability of Deductive Databases (FB, RM), pp. 44–55.
- CSL-1987-Volger #database
- Model Theory of Deductive Databases (HV), pp. 322–334.
- ICLP-1987-Helm87 #induction #logic programming #source code
- Inductive and Deductive Control of Logic Programs (RH), pp. 488–512.
- ICLP-1987-RamamohanaraoS87 #database #query
- Answering Queries in Deductive Database Systems (KR, JS), pp. 1014–1033.
- SLP-1987-DershowitzL87 #debugging
- Deductive Debugging (ND, YJL), pp. 298–306.
- SLP-1987-Mozes87 #database #logic
- A Deductive Database Based on Aristotelian Logic (EM), pp. 244–252.
- SLP-1987-SchmidtKGB87 #compilation
- Compiling Exploratory and Goal-Directed Deduction into Sloppy Delta-Iteration (HS, WK, UG, RB), pp. 234–243.
- SLP-1987-Wallace87 #constraints #database #implementation #performance
- Negation by Constraints: A Sound and Efficient Implementation of Negation in Deductive Databases (MW), pp. 253–263.
- PODS-1986-BidoitH #database
- Positivism vs. Minimalism in Deductive Databases (NB, RH), pp. 123–132.
- PODS-1986-Naughton #database #independence #recursion
- Data Independent Recursion in Deductive Databases (JFN), pp. 267–279.
- SIGMOD-1986-Imielinski #database #query
- Query Processing in Deductive Databases with Incomplete Information (TI), pp. 268–280.
- VLDB-1986-ChakravarthyM #database #graph #multi #query #using
- Multiple Query Processing in Deductive Databases using Query Graphs (USC, JM), pp. 384–391.
- VLDB-1986-ThomRN #algorithm #database
- A Superjoin Algorithm for Deductive Databases (JAT, KR, LN), pp. 189–196.
- CADE-1986-OppacherS #heuristic #proving
- Controlling Deduction with Proof Condensation and Heuristics (FO, ES), pp. 384–393.
- CADE-1986-Schneider
- An Improvement of Deduction Plans: Refutation Plans (HAS), pp. 377–383.
- CADE-1986-Stickel86a #automation
- The KLAUS Automated Deduction System (MES), pp. 703–704.
- CADE-1986-Traugott86a #sorting #source code #synthesis
- Deductive Synthesis of Sorting Programs (JT), pp. 641–660.
- LICS-1986-JonssonMW #data flow #network #synthesis #towards
- Towards Deductive Synthesis of Dataflow Networks (BJ, ZM, RJW), pp. 26–37.
- SLP-1986-BoscoG86 #named
- IDEAL: An Ideal Deductive Applicative Language (PGB, EG), pp. 89–94.
- VLDB-1985-Zaniolo #representation #retrieval
- The Representation and Deductive Retrieval of Complex Objects (CZ), pp. 458–469.
- ICALP-1985-MannaW #automation
- Special Relations in Automated Deduction (ZM, RJW), pp. 413–423.
- SLP-1985-CoxP85 #logic programming
- Surface Deduction: A Uniform Mechanism for Logic Programming (PTC, TP), pp. 220–227.
- CADE-1984-ForsytheM #implementation
- Implementation Strategies for Plan-Based Deduction (KF, SM), pp. 426–444.
- CADE-1984-Miller #proving
- Expansion Tree Proofs and Their Conversion to Natural Deduction Proofs (DM), pp. 375–393.
- CADE-1982-GreenbaumNOP #comparison #implementation
- Comparison of Natural Deduction and Locking Resolution Implementations (SG, AN, PO, DAP), pp. 159–171.
- CADE-1982-PietrzykowskiM #backtracking #exponential #performance
- Exponential Improvement of Efficient Backtracking: A Strategy for Plan-Based Deduction (TP, SM), pp. 223–239.
- ICALP-1981-MeyerSM #logic #problem
- The Deducibility Problem in Propositional Dynamic Logic (ARM, RSS, GM), pp. 238–248.
- DAC-1980-GiambiasiMM #fault #simulation
- Methods for generalized deductive fault simulation (NG, AM, DM), pp. 386–392.
- CADE-1980-Andrews #proving
- Transforming Matings into Natural Deduction Proofs (PBA), pp. 281–292.
- VLDB-1979-Dahl #database #design #logic #natural language
- Logical Design of Deductive Natural Language Consultable Data Bases (VD), pp. 24–31.
- DAC-1979-KjelkerudT #fault #generative #logic #simulation #testing #using
- Generation of hazard free tests using the D-algorithm in a timing accurate system for logic and deductive fault simulation (EK, OT), pp. 180–184.
- DAC-1978-MiaraG #fault #simulation
- Dynamic and deductive fault simulation (AM, NG), pp. 439–443.
- STOC-1977-HarelPS #axiom #proving #recursion #source code
- A Complete Axiomatic System for Proving Deductions about Recursive Programs (DH, AP, JS), pp. 249–260.
- VLDB-1976-KelloggKT #data transformation
- A Deductive Capability for Data Management (CK, PK, LT), pp. 181–196.
- STOC-1976-Owicki #consistency #parallel #source code #verification
- A Consistent and Complete Deductive System for the Verification of Parallel Programs (SSO), pp. 73–86.