FLOC 2018: FEDERATED LOGIC CONFERENCE 2018
IJCAR PROCEEDINGS 9TH IJCAR, 2018

Editors: Stephan Schulz, Didier Galmiche and Roberto Sebastiani

AuthorsTitlePaperTalk
Martin GieseIndustrial Data Access
Erika AbrahamSymbolic Computation Techniques in SMT Solving: Mathematical Beauty meets Efficient Heuristics
Jean Marie Lagniez, Daniel Le Berre, Tiago de Lima and Valentin MontmirailAn Assumption-Based Approach for Solving The Minimal S5-Satisfiability ProblemJul 14 14:00
Yizheng Zhao and Renate A. SchmidtFAME: An Automated Tool for Semantic Forgetting in Expressive Description LogicsJul 14 16:30
Alexander Bentkamp, Jasmin Christian Blanchette, Simon Cruanes and Uwe WaldmannSuperposition for Lambda-Free Higher-Order LogicJul 16 11:30
Miika Hannula and Sebastian LinkAutomated Reasoning about Key SetsJul 17 11:30
Michael Peter Lettmann and Nicolas PeltierA Tableaux Calculus for Reducing Proof SizeJul 15 10:00
Franziska Rapp and Aart MiddeldorpFORT 2.0Jul 17 15:15
Anders Schlichtkrull, Jasmin Christian Blanchette, Dmitriy Traytel and Uwe WaldmannFormalizing Bachmair and Ganzinger's Ordered Resolution ProverJul 15 12:00
Alexander Steen and Christoph BenzmüllerThe Higher-Order Prover Leo-IIIJul 17 14:00
Jeremy Dawson, Nachum Dershowitz and Rajeev GoreWell-Founded UnionsJul 15 15:00
Katalin Fazekas, Fahiem Bacchus and Armin BiereImplicit Hitting Set Algorithms for Maximum Satisfiability Modulo TheoriesJul 14 11:30
Sylvain Conchon, David Declerck and Fatiha ZaidiCubicle-W: Parameterized Model Checking on Weak MemoryJul 17 14:30
Florian Lonsing and Uwe EglyQRAT+: Generalizing QRAT by a More Powerful QBF Redundancy PropertyJul 15 09:00
Guillaume Melquiond and Raphaël Rieu-HelftA Why3 framework for reflection proofs and its application to GMP's algorithmsJul 15 17:30
Marcelo Finger and Sandro PretoProbably Half True: Probabilistic Satisfiability over Lukasiewicz Infinitely-valued LogicJul 17 11:00
André PlatzerUniform Substitution for Differential Game LogicJul 15 17:00
Max Kanovich, Stepan Kuznetsov, Vivek Nigam and Andre ScedrovA Logical Framework with Commutative and Non-Commutative SubexponentialsJul 15 16:30
Peter Backeman, Aleksandar Zeljić, Christoph M. Wintersteiger and Philipp RümmerExploring Approximations for Floating-Point Arithmetic using UppSATJul 15 11:00
Manuel Bodirsky and Johannes GreinerComplexity of Combinations of Qualitative Constraint Satisfaction ProblemsJul 16 09:30
Mnacho Echenim, Nicolas Peltier and Yanis SellamiA Generic Framework for Implicate Generation Modulo TheoriesJul 14 12:00
Stefan Ciobaca and Dorel LucanuA Coinductive Approach to Proving Reachability in Logically Constrained Term Rewriting SystemsJul 14 16:00
Cunjing Ge, Feifei Ma, Tian Liu, Jian Zhang and Xutong MaA New Probabilistic Algorithm for Approximate Model CountingJul 14 15:00
Martin BrombergerA Reduction from Unbounded Linear Mixed Arithmetic Problems into Bounded ProblemsJul 15 12:00
Nao Hirokawa, Julian Nagele and Aart MiddeldorpCops and CoCoWeb: Infrastructure for Confluence ToolsJul 17 15:00
Pei Huang, Feifei Ma, Jian Zhang, Cunjing Ge and Hantao ZhangInvestigating the Existence of Large Sets of Idempotent Quasigroups via Satisfiability TestingJul 14 14:30
Jasmin Christian Blanchette, Nicolas Peltier and Simon RobillardSuperposition with Datatypes and CodatatypesJul 16 11:00
Nicholas Smallbone and Koen ClaessenEfficient encodings of first-order Horn formulas in equational logicJul 16 12:00
Evgenii Kotelnikov, Laura Kovacs and Andrei VoronkovA FOOLish Encoding of the Next State Relations of Imperative ProgramsJul 15 16:30
Dominique Larchey-WendlingConstructive Decision via Redundancy-free Proof-SearchJul 15 11:00
Nicolas Jeannerod and Ralf TreinenDeciding the First-Order Theory of an Algebra of Feature Trees with UpdatesJul 16 09:00
Jens Katelaan, Dejan Jovanović and Georg WeissenbacherA Separation Logic with Data: Small Models and AutomationJul 17 10:00
Sarah Winkler and Georg MoserMaedMax: A Maximal Ordered Completion ToolJul 17 14:45
Matteo Acclavio and Lutz StrassburgerFrom Syntactic Proofs to Combinatorial ProofsJul 15 16:00
Cláudia Nalon and Dirk PattinsonA Resolution-Based Calculus for Preferential LogicsJul 15 09:00
Benjamin Kiesl, Adrian Rebola-Pardo and Marijn HeuleExtended Resolution Simulates DRATJul 15 09:30
Bohua Zhan and Maximilian P. L. HaslbeckVerifying Asymptotic Time Complexity of Imperative Programs in IsabelleJul 15 11:30
Jochen Hoenicke and Tanja SchindlerEfficient Interpolation for the Theory of ArraysJul 14 11:00
Bartosz Piotrowski and Josef UrbanATPboost: Learning Premise Selection in Binary Setting with ATP FeedbackJul 17 14:15
Dennis Müller, Florian Rabe and Michael KohlhaseTheories as TypesJul 15 17:30
Andrew Reynolds, Arjun Viswanathan, Haniel Barbosa, Cesare Tinelli and Clark BarrettDatatypes with Shared SelectorsJul 15 11:30
Yevgeny Kazakov and Peter SkočovskýEnumerating Justifications using ResolutionJul 15 09:30
Alexey Ignatiev, Filipe Pereira, Nina Narodytska and Joao Marques-SilvaA SAT-Based Approach to Learn Explainable Decision SetsJul 15 10:00
Son Ho, Oskar Abrahamsson, Ramana Kumar, Magnus O. Myreen, Yong Kiam Tan and Michael NorrishProof-Producing Synthesis of CakeML with I/O and Local State from Monadic HOL FunctionsJul 15 17:00
Julio Cesar Lopez Hernandez and Konstantin KorovinAn abstraction-refinement framework for reasoning with large theoriesJul 17 12:00
Jacopo Urbani, Markus Krötzsch, Ceriel Jacobs, Irina Dragoste and David CarralEfficient Model Construction for Horn Logic with VLog: System DescriptionJul 14 16:45
Anupam DasFocussing, MALL and the polynomial hierarchyJul 16 10:00
Etienne Payet and Fausto SpotoChecking Array Bounds by Abstract Interpretation and Symbolic ExpressionsJul 15 16:00