The following pages link to EPiC Series in Computing (Q4645721):
Displaying 50 items.
- Programming by Composing Filters (Q4645722) (← links)
- Theorem Provers For Every Normal Modal Logic (Q4645724) (← links)
- Blocked Clauses in First-Order Logic (Q4645725) (← links)
- First-Order Interpolation and Interpolating Proof Systems (Q4645726) (← links)
- Towards a Semantics of Unsatisfiability Proofs with Inprocessing (Q4645727) (← links)
- Deep Network Guided Proof Search (Q4645728) (← links)
- Deep Proof Search in MELL (Q4645729) (← links)
- TacticToe: Learning to Reason with HOL4 Tactics (Q4645730) (← links)
- Automated analysis of Stateflow models (Q4645732) (← links)
- Decidable linear list constraints (Q4645734) (← links)
- RACCOON: A Connection Reasoner for the Description Logic ALC (Q4645736) (← links)
- On the Interaction of Inclusion Dependencies with Independence Atoms (Q4645737) (← links)
- Propagators and Solvers for the Algebra of Modular Systems (Q4645738) (← links)
- Analyzing Runtime Complexity via Innermost Runtime Complexity (Q4645739) (← links)
- Higher order interpretation for higher order complexity (Q4645740) (← links)
- From SAT to Maximum Independent Set: A New Approach to Characterize Tractable Classes (Q4645742) (← links)
- Parallel Graph Rewriting with Overlapping Rules (Q4645743) (← links)
- A Quantitative Partial Model-Checking Function and Its Optimisation (Q4645744) (← links)
- Synchronizing Constrained Horn Clauses (Q4645746) (← links)
- Quantified Heap Invariants for Object-Oriented Programs (Q4645747) (← links)
- Proving uniformity and independence by self-composition and coupling (Q4645748) (← links)
- Gödel logics and the fully boxed fragment of LTL (Q4645749) (← links)
- Bunched Hypersequent Calculi for Distributive Substructural Logics (Q4645751) (← links)
- A uniform framework for substructural logics with modalities (Q4645752) (← links)
- A One-Pass Tree-Shaped Tableau for LTL+Past (Q4645753) (← links)
- Coq without Type Casts: A Complete Proof of Coq Modulo Theory (Q4645754) (← links)
- Reasoning about Translation Lookaside Buffers (Q4645755) (← links)
- Formally Proving the Boolean Pythagorean Triples Conjecture (Q4645756) (← links)
- Verification, Testing, and Runtime Monitoring of Automotive Exhaust Emissions (Q5222942) (← links)
- Playing with the Maximum-Flow Problem (Q5222943) (← links)
- When Are Two Gossips the Same? (Q5222944) (← links)
- Function Summarization Modulo Theories (Q5222945) (← links)
- Matching in the Description Logic FL0 with respect to General TBoxes (Q5222946) (← links)
- Lyndon Interpolation holds for the Prenex ⊃ Prenex Fragment of Gödel Logic (Q5222947) (← links)
- Decidable Inequalities over Infinite Trees (Q5222948) (← links)
- Evaluation of Domain Agnostic Approaches for Enumeration of Minimal Unsatisfiable Subsets (Q5222949) (← links)
- Why These Automata Types? (Q5222950) (← links)
- A Verified Efficient Implementation of the LLL Basis Reduction Algorithm (Q5222951) (← links)
- Efficient SAT-Based Encodings of Conditional Cardinality Constraints (Q5222954) (← links)
- Reasoning About Prescription and Description Using Prioritized Default Rules (Q5222955) (← links)
- Two-variable First-Order Logic with Counting in Forests (Q5222957) (← links)
- Quasipolynomial Set-Based Symbolic Algorithms for Parity Games (Q5222958) (← links)
- The involutions-as-principal types/application-as-unification Analogy (Q5222959) (← links)
- Left-Handed Completeness for Kleene algebra, via Cyclic Proofs (Q5222960) (← links)
- Experiments in Verification of Linear Model Predictive Control: Automatic Generation and Formal Verification of an Interior Point Method Algorithm (Q5222962) (← links)
- Graph Path Orderings (Q5222963) (← links)
- The Weak Completion Semantics and Equality (Q5222964) (← links)
- LTL with Arithmetic and its Applications in Reasoning about Hierarchical Systems (Q5222965) (← links)
- Arrays Made Simpler: An Efficient, Scalable and Thorough Preprocessing (Q5222967) (← links)
- Loop Analysis by Quantification over Iterations (Q5222968) (← links)
