LPAR-22. 22nd International Conference on Logic for Programming, Artificial Intelligence and Reasoning

39 articles666 pagesPublished: October 23, 2018


Pages 1-17
Pages 18-25
Pages 26-35
Pages 36-55
Pages 56-75
Pages 76-94
Pages 95-110
Pages 111-130
Pages 131-142
Pages 143-163
Pages 164-180
Pages 181-195
Pages 196-213
Pages 214-232
Pages 233-253
Pages 254-270
Pages 271-289
Pages 290-306
Pages 307-325
Pages 326-342
Pages 343-362
Pages 363-380
Pages 381-399
Pages 400-417
Pages 418-434
Pages 435-453
Pages 454-470
Pages 471-487
Pages 488-497
Pages 498-514
Pages 515-533
Pages 534-542
Pages 543-563
Pages 564-582
Pages 583-603
Pages 604-619
Pages 620-636
Pages 637-655
Pages 656-666


ACTL, Algorithm Portfolios, amortized analysis, antichain-based tree automata language inclusion, API, Arithmetic Circuits, automata2, automated reasoning, axiomatisation, bit-width, Boolean operations, Bounded Model Checking2, cardinality constraints, CEGAR, clause learning, cognitive reasoning, complexity3, computer algebra, Constrained Uniform Sampling, constraint satisfaction, constraint solving, convex optimization, Coq, cost semantics, counterexample, counterfactual reasoning, Craig interpolation, Cyclic Graphs, cyclic proofs2, d-DNNF, data streaming, deadlock, decidability, decision procedures, default logic, deontic logic, Description Logic, Description Logics, Digital Library, Distributed IC3, Distributed SMT, Divide and Conquer, Domain-agnostic, ECTL, epistemic logic, EPR, equational reasoning, Erlang, ethical decision-making, event lists, Exclusive-OR, experimental evaluation, finite model finder, finite satisfiability, first-order logic, Fluent Calculus, formal languages and automata theory, formal verification, fragments of first-order logic, Function Summaries, game theory, games, garbage collection, general satisfiability, Geometry of Interaction, gossip protocols, Graph games, graph rewriting, Gödel logics, Herbrand expansions, hierarchical systems, incremental verification, induction, inductive definitions, Infeasibility analysis, Infinite alphabets, infinite descent, infinite trees, inprocessing techniques, Integer Linear Programming, Interference, interior point method, interpolation, invariant generation, Isabelle/HOL, Kleene algebra, knowledge compilation, knowledge-based protocols, Kripke semantics, lambda calculus, Lamport clocks, lattice basis reduction, linear inequalities, LL(1) parsing, logic and computational complexity, logic programming, Lookahead Heuristic, loop, LP Solving, LTL with arithmetic, Lyndon interpolation, matching, minimal unsatisfiable subsets, modal logic, model checking2, Model Predictive Control, modelling, monotonicity, Multigraphs, MUS enumeration, mutable memory, Nash equilibrium, Nonmonotonic Proof Calculus, Numerical Software Verification, Nuprl, omega-regular languages, operational semantics, parity games, path orderings, pattern matching, polymorphism, program analysis, program verification, progress measure, proof checker, propositional satisfiability, protocol verification, pushdown automata, quantified bit-vectors, Random walks and Markov chains, Rational synthesis, reachability games, read-over-write simplification, regular languages2, Resource Analysis, Resource Bound Analysis, reversible computations, rewrite orderings, SAT2, SAT solving2, Satisfiability Modulo Theories2, Satisfiability Modulo Theory2, Skolemization, SMT encoding, SMT solving, software verification, static analysis, success types, succinctness, symbolic computation, tableaux system, termination2, The guarded fragment, The two-variable fragment, Theory of Arrays, Three-Valued Lukasiewicz Logic, tree automata, two-variable logic with counting quantifiers, type inference, type systems, types, unranked trees/forests, Unsatisfiability analysis, Verified theorem prover backend, Weak Completion, web-based GUI, Witness, word combinatorics, YubiHSM, YubiKey