EasyChair Publications
Search
LPAR-17-short Volume Information
Volume:Andrei Voronkov, Geoff Sutcliffe, Matthias Baaz and Christian Fermüller (editors)
LPAR-17-short. short papers for 17th International Conference on Logic for Programming, Artificial intelligence, and Reasoning.

LPAR-17-short Volume Information

Title:LPAR-17-short. short papers for 17th International Conference on Logic for Programming, Artificial intelligence, and Reasoning.
Editors:Andrei Voronkov, Geoff Sutcliffe, Matthias Baaz and Christian Fermüller
Series:EPiC Series in Computing
Volume:13
Publication date:March 25, 2013

Papers

AuthorsTitlePagesPDF
Jesse Alama and Sara L. UckelmanProof rules for the dialogical logic N1-6
Jesse Alama and Sara L. UckelmanPlaying Lorenzen Dialogue Games on the Web7-12
Matthias Baaz and Oliver FaschingGödel logics with an operator shifting truth values13-14
Libor BehounekFeasibility as a gradual notion15-19
Jasmin Christian BlanchetteNitpick: A Counterexample Generator for Isabelle/HOL Based on the Relational Model Finder Kodkod20-25
Karel Chvalovský and Petr CintulaNote on Deduction Theorems in Contraction-Free Logics26-29
Petr Cintula and George MetcalfeComplexity of Admissible Rules in the Implication-Negation Fragment of Intuitionistic Logic30-34
Sylvain Conchon, Evelyne Contejean and Mohamed IguernelalaGround Associative and Commutative Completion Modulo Shostak Theories35-40
Marijn Heule, Matti Järvisalo and Armin BiereCovered Clause Elimination41-46
Beishui Liao, Li Jin and Robert KoonsDynamics of Argumentation Systems: A Basic Theory47-51
Uwe Pfeiffer, Tomas Karnagel and Guido SchefflerA Sudoku-Solver for Large Puzzles using SAT52-57
Hannes Strass and Michael ThielscherDefault Reasoning in Action Domains with Conditional, Non-Local Effect Actions58-63

Keyphrases

CountKeyphrase
2computational complexity, dialogical logic, dialogue game
1ac completion, admissible rules, answer set programming, argumentation, associativity and commutativity, axiom, bci logic, clause elimination, contraction free logics, counterexample generation, decision procedure, dynamics, feasibility, gradualness, gödel logic, heuristic, higher order logic, interactive theorem proving, intuitionistic logic, local deduction theorems, logical omniscience, model finding, non monotonic logic, non monotonic reasoning, non recursiveness, object oriented programming, proof theory, puzzle, reasoning about actions and change, ring operator, sat, sat preprocessing, satisfiability checking, shostak theories, simplification, smt solvers, stochastic search, sudoku, t norm logics, web mathematics, Łukasiewicz logic