the proceedings contain 45 papers. the special focus in this conference is on logic for programming, artificial intelligence, and reasoning. the topics include: Characterising space complexity classes via Knuth-Bendix...
ISBN:
(纸本)9783642162411
the proceedings contain 45 papers. the special focus in this conference is on logic for programming, artificial intelligence, and reasoning. the topics include: Characterising space complexity classes via Knuth-Bendix orders;focused natural deduction;how to universally close the existential rule;on the Complexity of the Bernays-Schönfinkel Class with Datalog;magically constraining the inverse method using dynamic polarity assignment;lazy abstraction for size-change termination;a syntactical approach to qualitative constraint networks merging;on the satisfiability of two-variable logic over data words;generic methods for formalising sequent calculi applied to provability logic;awareness in games, awareness in logic;characterising probabilistic processes logically: (Extended abstract);fCube: An efficient prover for Intuitionistic propositional logic;superposition-Based Analysis of First-Order Probabilistic Timed Automata;A nonmonotonic extension of KLM Preferential logic P;on strong normalization of the Calculus of Constructions with type-based termination;aligators for arrays (tool paper);Clause elimination procedures for CNF formulas;Partitioning SAT instances for distributed solving;infinite families of finite string rewriting systems and their confluence;polite theories revisited;human and unhuman commonsense reasoning;clausal graph tableaux for hybrid logic with eventualities and difference;the consistency of the CADIAG-2 knowledge base: A probabilistic approach;on the Complexity of Model Expansion;labelled Unit Superposition Calculi for Instantiation-Based reasoning;Boosting local search thanks to CDCL;interpolating quantifier-free Presburger Arithmetic;variable compression in ProbLog;Improving resource-unaware SAT solvers;expansion nets: Proof-nets for propositional classical logic;revisiting matrix interpretations for polynomial derivational complexity of term rewriting;Gödel logics – A SURVEY;bottom-up tree automata with term constraints.
the proceedings contain 45 papers. the topics discussed include: the complexity of partial-observation parity games;awareness in games, awareness in logic;human and unhuman commonsense reasoning;tableau calculus for t...
ISBN:
(纸本)364216241X
the proceedings contain 45 papers. the topics discussed include: the complexity of partial-observation parity games;awareness in games, awareness in logic;human and unhuman commonsense reasoning;tableau calculus for the logic of comparative similarity over arbitrary distance spaces;extended computation tree logic;using causal relationships to deal withthe ramification problem in action formalisms based on description logics;generating counterexamples for structural inductions by exploiting nonstandard models;characterizing space complexity classes via Knuth-Bendix orders;how to universally close the existential rule;magically constraining the inverse method using dynamic polarity assignment;lazy abstraction for size-change termination;a syntactical approach to qualitative constraint networks merging;on the satisfiability of two-variable logic over data words;and generic methods for formalizing sequent calculi applied to provability logic.
the proceedings contain 30 papers. the special focus in this conference is on logicprogramming and Non-monotonic reasoning. the topics include: A Sequent Calculus for Generalized Inductive Definitions;tExplain: ...
ISBN:
(纸本)9783031742088
the proceedings contain 30 papers. the special focus in this conference is on logicprogramming and Non-monotonic reasoning. the topics include: A Sequent Calculus for Generalized Inductive Definitions;tExplain: Information Extraction with Explanations;ASP-Based Large Neighborhood Prioritized Search for Course Timetabling;towards Industrial-Scale Product Configuration;An ILASP-Based Approach to Repair Petri Nets;abstract Dialectical Frameworks are Boolean Networks;Using Learning from Answer Sets for Robust Question Answering with LLM;Multi-paradigm logicprogramming in the ErgoAI System;An ASP-Based Approach to Water Distribution System Reconstruction;consequence Operators of Characterization logics – the Case of Abstract Argumentation;Efficiently Grounding FOL Using Bit Vectors;Integrating MiniZinc with ASP Chef: Browser-Based Constraint programming for Education and Prototyping;answer Set Explanations via Preferred Unit-Provable Unsatisfiable Subsets;Towards Mass Spectrum Analysis with ASP;monitoring and Scheduling of Semiconductor Failure Analysis Labs;a Semantical Approach to Abstraction in Answer Set programming and Assumption-Based Argumentation;on Forgetting in Assumption-Based Argumentation;Towards Explainable Weather Forecasting through FastLAS;semantic-Based Arguments Using logicprogramming Rewriting Systems;modelling Dialogues in a Concurrent Language for Argumentation;a Fixpoint Characterisation of Temporal Equilibrium logic;a Category-theoretic Perspective on Higher-Order Approximation Fixpoint theory;a Simulation for Supply Chains Contract Execution;reasoning and Explanation Generation in Ad Hoc Collaboration Between Humans and Embodied AI;policies, Penalties, and Autonomous Agents;LTLf2ASP: LTLf Bounded Satisfiability in ASP;Integrating Structured Declarative Language (SDL) into ASP Chef;a Generalisation of Epistemic Splitting Property.
the proceedings contain 27 papers. the topics discussed include: decidable fragments of many-sorted logic;one-pass tableaux for computation tree logic;extending a resolution power for inequalities on elimentary functi...
详细信息
ISBN:
(纸本)9783540755586
the proceedings contain 27 papers. the topics discussed include: decidable fragments of many-sorted logic;one-pass tableaux for computation tree logic;extending a resolution power for inequalities on elimentary functions;model checking the first-order fragment of higher-order fixpoint logic;least and greatest fixed points in linear logic;the semantics of consistency and trust in peer data exchange systems;completeness and decidability in sequence logic;matching in hybrid terminologies;verifying cryptographic protocols with subterms constraints;deciding knowledge in security protocols for monoidal equational theories;mechanized verification of CPS transformations;preferential description logics;on two extensions of abstract categorial grammars;on finite satisfiability of the guarded fragment with equivalence or transitive guards;and retractile proof nets of the purely multiplicative and additive fragment of linear logic.
the proceedings contain 36 papers. the topics discussed include: a decomposition rule for decision procedures by resolution-based calculi;combining lists with non-stably infinite theories;abstract model generation for...
详细信息
ISBN:
(纸本)3540252363
the proceedings contain 36 papers. the topics discussed include: a decomposition rule for decision procedures by resolution-based calculi;combining lists with non-stably infinite theories;abstract model generation for preprocessing clause sets;flat and one-variable clauses: complexity of verifying cryptographic protocols with single blind copying;applications of general exact satisfiablility in propositional logic modeling;suitable graphs for answer set programming;how to fix it: using fixpoints in different contexts;reasoning about systems with transition fairness;the inverse method for the logic of bunched implications;and implementing efficient resource management for linear logicprogramming.
the proceedings contain 30 papers from the logic for programming, artificial intelligence, and reasoning: 10thinternationalconference, LPAR 2003. the topics discussed include: congruence closure with integer offsets...
详细信息
the proceedings contain 30 papers from the logic for programming, artificial intelligence, and reasoning: 10thinternationalconference, LPAR 2003. the topics discussed include: congruence closure with integer offsets;a machine-verified code generator;extensions of non-standard inferences to description logics with transitive roles;improving dependency pairs;extended caconicity of certain topological properties of set spaces;ordered diagnosis;minimizing automata on infinite words;automatic structures of bounded degree and strict geometry of interaction graph models.
the proceedings contain 34 papers. the topics discussed include: automatic inference of resource consumption bounds;matrix interpretations for polynomial derivational complexity of rewrite systems;parameterized comple...
ISBN:
(纸本)9783642287169
the proceedings contain 34 papers. the topics discussed include: automatic inference of resource consumption bounds;matrix interpretations for polynomial derivational complexity of rewrite systems;parameterized complexity and fixed-parameter tractability of description logicreasoning;enfragmo: a system for modeling and solving search problems withlogic;automated and human proofs in general mathematics: an initial comparison;lazy abstraction with interpolants for arrays;backward trace slicing for conditional rewrite theories;forgetting for defeasible logic;solving language equations and disequations with applications to disunification in description logics and monadic set constraints;dual-priced modal transition systems with time durations;finding finite herbrand models;and monitor-based statistical model checking for weighted metric temporal logic.
the proceedings contain 50 papers. the topics discussed include: independently checkable proofs from decision procedures: issues and progress;Zap: automated theorem proving for software analysis;scaling up: computers ...
详细信息
the proceedings contain 50 papers. the topics discussed include: independently checkable proofs from decision procedures: issues and progress;Zap: automated theorem proving for software analysis;scaling up: computers vs. common sense;a new constraint solver for 3D lattices and its application to the protein folding problem;disjunctive constraint lambda calculi;optimizing the runtime processing of types in polymorphic logicprogramming languages;the four sons of penrose;termination of fair computations in term rewriting;matching with regular constraints;automating coherent logic;regular derivations in basic superposition-based calculi;on the specification on sequent systems;experimental evaluation of classical automata constructions;reasoning about incompletely defined programs;a unified memory model for pointers;pushdown module checking;functional correctness proofs of encryption algorithms;and algebraic intruder deductions.
the proceedings contain 30 papers. the special focus in this conference is on logic for programming, artificial intelligence, and reasoning. the topics include: From tableaux to automata for description logics;imperat...
ISBN:
(纸本)3540201017
the proceedings contain 30 papers. the special focus in this conference is on logic for programming, artificial intelligence, and reasoning. the topics include: From tableaux to automata for description logics;imperative object-based calculi in co-inductive type theories;congruence closure with integer offsets;a translation characterizing the constructive content of classical theories;extensions of non-standard inferences to description logics with transitive roles;extended canonicity of certain topological properties of set spaces;algebraic and model theoretic techniques for fusion decidability in modal logics;on closure under complementation of equational tree automata for theories extending ac;completeness of e-unification with eager variable elimination;handling equality in monodic temporal resolution;computing preferred answer sets in answer set programming;a syntax-based approach to reasoning about actions and events;minimizing automata on infinite words;accelerating proof search for zero-one linear constraint systems;NP-completeness results for deductive problems on stratified terms;automatic structures of bounded degree;an optimal automata approach to ltl model checking of probabilistic systems;a logical study on qualitative default reasoning with probabilities;strict geometry of interaction graph models and connection-based proof construction in non-commutative logic.
暂无评论