LPAR-21. 21st International Conference on Logic for Programming, Artificial Intelligence and Reasoning31 articles•522 pages•Published: May 4, 2017 PapersPages 1-13 | Pages 14-30 | Pages 31-48 | Pages 49-64 | Pages 65-84 | Pages 85-105 | Pages 106-124 | Pages 125-143 | Pages 144-161 | Pages 162-170 | Pages 171-180 | Pages 181-199 | Pages 200-211 | Pages 212-226 | Pages 227-248 | Pages 249-268 | Pages 269-285 | Pages 286-299 | Pages 300-318 | Pages 319-337 | Pages 338-355 | Pages 356-367 | Pages 368-384 | Pages 385-403 | Pages 404-416 | Pages 417-434 | Pages 435-455 | Pages 456-473 | Pages 474-489 | Pages 490-508 | Pages 509-522 |
KeyphrasesA* proof search, ALC, algebra, automated complexity analysis, automated reasoning3, automated theorem proving2, axiomatization, basic feasible functionals, BBI, blocked clauses2, Boolean Pythagorean Triples problem, bunched calculi, clause elimination, complexity, computational complexity, Confluent Rewrite Relations, connection method, Constrained Horn Clauses, constraint satisfaction, context-free languages, continuation-passing style, Coq, cut elimination, deep inference, deep learning, Description Logic, distributive substructural logics, DRAT proofs, Dunn-Mints calculi, educational logic software, evaluation strategies, first-order logic2, first-order theory, formal proofs, graph reachability, graph rewriting, Gödel logic, Higher-order complexity, higher-order logic2, Higher-Order Modal Logic, Horn Clause Solving, hypersequents, implication problem, inclusion dependency, independence, Independence atom, inductive invariant, infinite lists, interactive theorem proving, interpolation, interpretations, Isabelle/HOL, linear arithmetic, linear logic2, linear nested sequents, Linear Temporal Logic, linearization, logic of bunched implications, logical frameworks, LTL, LTL to automata translation, machine learning, maximum independent set, MELL, Memory Management Unit, memory models, model checking, model expansion, modular systems, monadic fragment, multimodalities, nondeterminism, omega-automata, Operating Systems, Overlapping Rewrite Systems, Parallel Rewriting, Partial Model Checking, Past Operators, Preprocessing, probabilistic programs, program analysis, program verification2, proof assistant, proof automation, proof search, proof theory, propagators, propositional satisfiability, quantitative reasoning, Reasoner, relational logic, relational verification, Resolution Calculus, resource types, SAT, SAT solving, Semantical Embedding, semi-deterministic automata, semiring, separation logic, serious games, software model checking, solvers, soundness, Stateflow, structural rules, superposition, tableaux, term rewriting, theorem proving2, Tractable classes, Translation Lookaside Buffer, type theory, Unbounded Model Checking, uniformity |
|