EPiC series in computing 2018: all accepted papers
- Charge Pump Phase-Locked Loops and Full Wave Rectifiers for Reachability Analysis ↗Omar Ali Beg, Ali Davoudi, Taylor Thomas Johnson
- Classifier Labels as Language Grounding for Explanations ↗Sai Prabhakar Pandi Selvaraj, Manuela Veloso, Stephanie L. Rosenthal
- Cocktail II ↗Michael Franssen
- Conditional Independence in Categories ↗Alex K. Simpson
- Constraint-Based Modeling in Systems Biology ↗Alexander Bockmayr
- Coproducts of Distributive Lattice based Algebras ↗Leonardo Manuel Cabrer, Hilary A. Priestley
- Cross-layer Stack Design Framework in OMNeT++ ↗Doğanalp Ergenç, Ertan Onur A
- Cyclic Proofs and Coinductive Principles ↗Gavin Mendel-Gleason, Geoff W. Hamilton
- Data Conversion Method between a Natural Number and a Binary Tree for an Inductive Proof and Its Application ↗Kazuko Takahashi, Shizuo Yoshimaru, Mizuki Goto
- Decision Problems for Linear Recurrence Sequences ↗Joël Ouaknine
- Deep Proof Search in MELL ↗Ozan Kahramanoğulları
- Default Reasoning in Action Domains with Conditional, Non-Local Effect Actions ↗Hannes Straß, Michael Thielscher
- Derivational modal logic of real line with difference modality ↗Andrey Valer'evich Kudinov
- Designing a solver competition: the QBFEVAL'10 case study ↗Claudia Peschiera, Luca Pulina, Armando Tacchella
- Detecting Modular ACU Structural Symmetries ↗Marı́a Alpuente, Santiago Escobar, Javier Espert
- Distributed Control Synthesis ↗Doron Peled, Sven Schewe
- Djinn, Monotonic ↗Conor Thomas McBride
- Dynamics of Argumentation Systems: A Basic Theory ↗Beishui Liao, Li Jin, Robert Charles Koons
- Effect algebras with state operator ↗Sylvia Pulmannová
- Exploiting parallelism in the ME calculus ↗Tianyi Liang, Cesare Tinelli
- Exploring Predictability of SAT/SMT Solvers ↗Robert Brummayer, Duckki Oe, Aaron Stump
- Extended Abstract: Getting Engaged ↗Simon Thompson
- Extending Non-Termination Proof Techniques to Asynchronously Communicating Concurrent Programs ↗Matthias Kuntz, Stefan Leue, Christoph Scheben
- Extensions of ordering sets of states from effect algebras onto their MacNeille completions ↗Jiří Janda, Zdenka Riečanová
- Finding Minimal Reaction Sets in Large Metabolic Pathways ↗Takehide Soh, Katsumi Inoue
- Formal Replay of Translation Validation for Highly Optimised C ↗Thomas Arthur Leck Sewell
- Four-valued modal logic: Kripke semantics and duality ↗Achim Jung, Umberto Rivieccio
- From Classical Extensional Higher-Order Tableau to Intuitionistic Intentional Natural Deduction ↗Chad E. Brown, Christine Rizkallah
- From SAT to Maximum Independent Set: A New Approach to Characterize Tractable Classes ↗Yazid Mohamed Boumarafi, Lakhdar Saïs, Yakoub Salhi
- From free algebras to proof bounds ↗Silvio Ghilardi
- Funayama's theorem revisited ↗Guram Bezhanishvili, David Gabelaia, Mamuka Jibladze
- Functional Pearl: the Proof Search Monad ↗Jonathan Protzenko
- General Topos Semantics for Higher-Order Modal Logic ↗Steve Awodey, Kohei Kishida, Hans-Christoph Kotzsch
- Generalizing the concept of quantum triads ↗Radek Šlesinger
- Ground Associative and Commutative Completion Modulo Shostak Theories ↗Sylvain Conchon, Évelyne Contejean, Mohamed Iguernelala
- Gödel logics with an operator shifting truth values ↗Matthias Baaz A, Oliver Fasching
- Harmony Search Approach for Patient Scheduling in Emergency Laboratories ↗Imen Boudali, Nihel Mokhtar
- Hierarchic Superposition Revisited ↗Uwe Waldmann
- Hierarchical Combination of Unication Algorithms (Extended Abstract) ↗Serdar Erbatur, Deepak Kapur, Andrew M. Marshall et al.
- Howard Barringer: the Man who Invented the Past ↗Klaus Havelund
- Implementing Different Proof Calculi for First-order Modal Logics ↗Christoph Benzmüller, Jens Otten, Thomas Raths
- Implementing an Efficient SAT Solver for a Probabilistic Description Logic ↗Pavel Klinov, Bijan Parsia
- Improved Heuristic for Manipulation of Second-order Copeland Elections ↗Ramoni O. Lasisi, Abibat A. Lasisi
- Improving SAT-based Bounded Model Checking for Existential CTL through Path Reuse ↗Chuan Jiang, Gianfranco Ciardo
- Improving Statistical Linguistic Algorithms for Parsing Mathematics ↗Cezary Kaliszyk, Josef Urban, Jiri Vyskocil
- Initial Experiments on Deriving a Complete HOL Simplification Set ↗Cezary Kaliszyk, Thomas Sternagel
- Invariant Projections in Games ↗Abhijeet Mohapatra, Bertrand Decoster, Sudhir Agarwal et al.
- Laterally complete and projective hulls of semilinear residuated lattices ↗José Gil‐Férez, Antonio Ledda, Constantine Tsinakis
- Learning Importance of Preferences ↗Ying Zhu, Mirosław Truszczyński
- Local Driving in Higher-Order Positive Supercompilation via the Omega-theorem ↗Geoff W. Hamilton, Morten Heine Sørensen
- Local proofs and AVATAR ↗Giles Reger, Martin Suda
- Lyndon Interpolation holds for the Prenex ⊃ Prenex Fragment of Gödel Logic ↗Matthias Baaz A, Anela Lolić
- Making Automatic Theorem Provers more Versatile ↗Simon Cruanes
- Making the Evolution of Graphical Models Visible ↗Thomas Baar, Issam Bendaas
- Mathematics of 21st Century: A Personal View ↗Bruno Buchberger
- Meaning Formulas for Syntax-Based Mathematical Algorithms ↗William M. Farmer
- Measuring the Gap: Algorithmic Approximation Bounds for the Space Complexity of Stream Specifications ↗David M. Cerna, Wolfgang Schreiner
- My Life with an Automatic Theorem Prover ↗Jasmin Christian Blanchette
- Nonlinear Hybrid Automata Model of Excitable Cardiac Tissue ↗Houssam Abbas, Kuk Jin Jang, Rahul Mangharam
- Note on Deduction Theorems in Contraction-Free Logics ↗Karel Chvalovský, Petr Cintula A
- On (finite) distributive lattices with antitone involutions ↗Jan Kühr, Michal Botur
- On Natural Representations of Objects ↗Fouad B. Chedid
- On Reducing Clause DataBase in Glucose ↗Chu-Min Li, Xiao Fan, Ruchu Xu
- On and On the Temporal Way ↗Clare Dixon, Michael Fisher
- On fuzzification of topological categories ↗Sergejs Solovjovs
- On modal components of the S4-logics ↗Alexei Yu. Muravitsky
- On the Expressiveness of some Runtime Validation Techniques ↗Ylìès Falcone, Jean-Claude Fernandez, Laurent Mounier
- On the Termination of Positive Supercompilation ↗Geoff W. Hamilton
- Pandora's Box ↗Ronald Middelkoop, Cornelis Huizing, Ruurd Kuiper et al.
- Partial Regularization of First-Order Resolution Proofs ↗Jan Gorzny, Ezequiel Postan, Bruno Woltzenlogel Paleo
- Perspectives on Constraints, Process Algebras, and Hybrid Systems ↗Luca Bortolussi, Alberto Policriti
- Playing with the Maximum-Flow Problem ↗Orna Kupferman
- Possession as Linear Knowledge ↗Frank Pfenning
- Practical Aspects of SAT Solving ↗Armin Biere
- Priestley duality for (modal) N4-lattices ↗Ramón Jansana, Umberto Rivieccio
- Problem Libraries for Non-Classical Logics ↗Jens Otten, Thomas Raths
- Program Transformation for Program Verification ↗Alberto Pettorossi, Maurizio Proietti
- Projectivity and unification in the varieties of locally finite monadic MV-algebras ↗Antonio Di Nola, Revaz Grigolia, Giacomo Lenzi
- Proof Assistants and the Dynamic Nature of Formal Theories ↗Robert L. Constable
- Proof rules for the dialogical logic N ↗Jesse Alama, Sara L. Uckelman
- Proof theory for lattice-ordered groups ↗George Metcalfe
- Propagators and Solvers for the Algebra of Modular Systems ↗Bart Bogaerts, Eugenia Ternovska, David G. M. Mitchell
- Properties of Constrained Generalization Algorithms ↗Thierry Boy de la Tour
- QWeS2T for Type-Safe Web Programming ↗Thierry Sans, Iliano Cervesato
- Quantified Boolean Formulas: Call the Plumber! ↗Josef Lindsberger, Alexander Maringele, Georg Moser
- Real Analysis for Complex Systems ↗André Platzer
- Reasoning Inside The Box: Deduction in Herbrand Logics ↗Liron Cohen, Yoni Zohar
- Recent Advances in Unification for the EL Family ↗Franz Baader, Stefan Borgwardt, Barbara Morawska
- Reconstructing Information Retrieved from Multiple Websites ↗Héctor Valero, Carlos Castillo, Josep Silva
- Reducts and Modal Operators on Residuated Lattices ↗William Young
This page in Markdown → https://md.research.elamur.ai/free/en/venues/epic-series-in-computing/2018/papers/page/7/