The following pages link to Logic Journal of the IGPL (Q3061274):
Displayed 50 items.
- Abductive Equivalence in First-order Logic (Q3411859) (← links)
- Intelligent Alarm Correlation and Abductive Reasoning (Q3411861) (← links)
- A Layered Abductive Inference Framework for Diagramming Group Motions (Q3411862) (← links)
- Problem-Solving by Abduction in New Product Development (Q3411865) (← links)
- Algorithms for Computing Minimal Conflicts (Q3411866) (← links)
- The principle of open induction and Specker sequences (Q4644481) (← links)
- Decision and optimization problems in the unreliable-circuit logic (Q4644487) (← links)
- Epistemic extensions of combined classical and intuitionistic propositional logic (Q4644488) (← links)
- Minimizing disjunctive normal forms of pure first-order logic (Q4644489) (← links)
- Relatively compatible operations in BCK-algebras and some related algebras (Q4644490) (← links)
- A separable axiomatization of the Gabbay–de Jongh logics (Q4644492) (← links)
- Foreword (Q4644582) (← links)
- A paraconsistent route to semantic closure (Q4644583) (← links)
- Non-idempotent intersection types for the Lambda-Calculus (Q4644585) (← links)
- Modal operators for meet-complemented lattices (Q4644586) (← links)
- Symmetric operators on modal pseudocomplemented De Morgan algebras (Q4644587) (← links)
- Descriptions in quantum mechanics (Q4644588) (← links)
- Algebraizable logics and a functorial encoding of its morphisms (Q4644589) (← links)
- On the identity type as the type of computational paths (Q4644591) (← links)
- Dialectical categories, cardinalities of the continuum and combinatorics of ideals (Q4644592) (← links)
- Continuous versions of Haack’s puzzles: equilibria, eigen-states and ontologies (Q4644593) (← links)
- AGM-like paraconsistent belief change (Q4644595) (← links)
- Editors’ introduction: Special issue on non-classical modal and predicate logics (Q5014044) (← links)
- Deontic modals and hyperintensionality (Q5014045) (← links)
- A hyperintensional logical framework for deontic reasons (Q5014046) (← links)
- An intuitionistic logic for preference relations (Q5014047) (← links)
- A modal extension of Jaśkowski’s discussive logic $\textbf{D}_\textbf{2}$ (Q5014048) (← links)
- Proof theory for quantified monotone modal logics (Q5014049) (← links)
- Sequent calculus for 3-valued paraconsistent logic QMPT0 (Q5014053) (← links)
- From positive PDL to its non-classical extensions (Q5014054) (← links)
- Tracking reasons with extensions of relevant logics (Q5014055) (← links)
- Semantics for first-order superposition logic (Q5014056) (← links)
- Gentzen sequent calculi for some intuitionistic modal logics (Q5014057) (← links)
- Tableaux for essence and contingency (Q5014059) (← links)
- The subformula property of natural deduction derivations and analytic cuts (Q5014060) (← links)
- Elementary-base cirquent calculus II: Choice quantifiers (Q5014061) (← links)
- The Axiom of Choice and the Partition Principle from Dialectica Categories (Q5014062) (← links)
- Extensions of paraconsistent weak Kleene logic (Q5014063) (← links)
- The Russell-Prawitz embedding and the atomization of universal instantiation (Q5014064) (← links)
- Vector logic allows counterfactual virtualization by the square root of NOT (Q5014065) (← links)
- Special issue on logics and artificial intelligence (Q5018763) (← links)
- Clause tableaux for maximum and minimum satisfiability (Q5018764) (← links)
- A resolution calculus for MinSAT (Q5018765) (← links)
- Relaxing non-interference requirements in parallel plans (Q5018767) (← links)
- Solving Highly Cyclic Distributed Optimization Problems Without Busting the Bank: A Decimation-based Approach (Q5018768) (← links)
- Editorial: Special issue HAIS 2018 (Q5018769) (← links)
- Complexity of rule sets in mining incomplete data using characteristic sets and generalized maximal consistent blocks (Q5018771) (← links)
- On learning context-aware rules to link RDF datasets (Q5018773) (← links)
- Orthogonal Learning Firefly Algorithm (Q5018774) (← links)
- Revisiting separation: Algorithms and complexity (Q5020355) (← links)