Journal of Logic and Computation

Papers
(The median citation count of Journal of Logic and Computation is 0. The table below lists those papers that are above that threshold based on CrossRef citation counts [max. 250 papers]. The publications cover those that have been published in the past four years, i.e., from 2022-06-01 to 2026-06-01.)
ArticleCitations
Correction to: Opinion diffusion and campaigning on society graphs14
Arithmetical and Hyperarithmetical Worm Battles10
A logical characterization of constant-depth circuits over the reals9
The XAI system for answer set programming xASP28
Dynamic superiorities in Defeasible Logic8
Fixed point theorems for minimal numberings6
Proof-theoretic analysis of subabelian lattice logic6
Towards determinism in PDL: relations and proof theory5
On the study of acceptability in weighted argumentation frameworks through four-state labelling semantics5
Numeral completeness of weak theories of arithmetic5
Serial properties, selector proofs and the provability of consistency5
Modelling Supra-Classical Logic in a Boltzmann Neural Network: II Incongruence5
Dual counterpart intuitionistic logic5
Correction to: Parameterized Complexity of Dynamic Belief Updates: A Complete Map5
RETRACTED AND REPLACED: Logics for contact and measure4
Correction to: Some applications of Baaz’s generalization method to the study of the factors of Fermat numbers4
Complexity of injection structures induced by finite state transducers4
The logics for the complexity classes with limited non-determinism4
Unfriendly partitions when avoiding vertices of finite degree4
Normalization and cut-elimination theorems for some logics of evidence and truth4
Formalized soundness and completeness of epistemic and public announcement logic4
Iterative social consolidations: Forming beliefs from many-valued evidence and peers’ opinions4
An Argumentation-Based Approach for Goal Reasoning and Explanations Generation4
Estimating event probabilities via signal temporal logic and first occurrence distributions4
The failure of cut-elimination in cyclic proof for first-order logic with inductive definitions4
An algebraic approach to the study of monadic substructural predicate logics over FLew4
The flattening operator in team-based logics4
Congruence filter pairs, equational filter pairs and adjoints4
Weak Belnapian modal logic4
Cut-free labelled calculi and decidability for intuitionistic sentential logic with identity4
On Rosser theories4
Extension of constraint-procedural logic-generated environments for deep Q-learning agent training and benchmarking3
On sheaves on semicartesian quantales and their truth values3
A minimal coalition logic3
Argumentation Frameworks with Attack Classification3
Simple dynamic logic with parallel composition and applications to planning3
Modular orders on defaults in formal argumentation3
90 years of Gödel’s incompleteness theorems: Logic and computation3
Qualitative uncertainty and dynamics of argumentation through dynamic logic3
A sequent calculus for first-order logic formalized in Isabelle/HOL3
A comprehensive account of the burden of persuasion in abstract argumentation3
Advances in computational logic (CILC 2024)3
A typed lambda-calculus with first-class configurations3
A formalization of abstract argumentation in higher-order logic3
Incrementally predictive runtime verification3
Operating room scheduling via answer set programming: Improved encoding and test on real data3
Integrating individual preferences into collective argumentation3
Permissive and regulative norms in deontic logic3
Gates and circuits via Dunn semantics3
Uniform lyndon interpolation for basic non-normal modal and conditional logics3
Principles of logics for plausible reasoning2
A new perspective on completeness and finitist consistency2
Topologies on residuated lattices2
Implicit commitment in a general setting2
Characterizations of two basic hybrid logics2
Modal weak Kleene logics: axiomatizations and relational semantics2
A Modal Axiomatization of BK2
On the weak completeness of a fragment of linear temporal logic2
A calculus for modal compact Hausdorff spaces2
Randomness and invariance2
A fuzzy structure processing mechanism for graph grammar2
Uncertainty-based knowing how logic2
Normal functions and maximal order types2
Polyhedral semantics and the tractable approximation of Łukasiewicz infinitely-valued logic2
Non-distributive positive logic as a fragment of first-order logic over semilattices2
Avoiding Pragmatic Oddity: a bottom-up Defeasible Deontic Logic2
New encodings of the (Euclidean) travelling salesperson problem in constraint answer set programming on difference logic2
Classical computation over quantum architectures2
Descriptive complexity for neural networks via Boolean networks2
Relational models for the Lambek calculus with local contraction subexponentials2
Intuitionistic S4 as a logic of topological spaces2
Correction to: Conjunctive degrees and cylinders2
Modelling supra-classical logic in a Boltzmann neural network: III adaptation2
Strategic and private reasoning with the concurrent (timed) language for argumentation2
Wanted dead or alive: epistemic logic for impure simplicial complexes2
Polyatomic logics and generalized Blok–Esakia theory2
Context-based argumentation frameworks and multi-agent consensus building2
Conditionals and modals in contexts2
Temporal logics for compartmental models2
Bounded model checking distributed temporal logic2
The adjacent fragment and Quine’s limits of decision2
A minimal substitution basis for the Kalmár elementary functions2
An encoding of abstract dialectical frameworks into higher-order logic2
A Representation of Lawson compact L-domains by information systems2
Justification logic and type theory as formalizations of intuitionistic propositional logic2
Scheduling pre-operative assessment clinic with answer set programming1
Efficient compliance checking of RDF data1
Tense logics based on posets1
Reflexive combinatory algebras1
Limited-knowledge propositional announcement synthesis under Dalal revision: tight PH bounds, parameterized tractability and kernelization1
Retraction and replacement of: Logics for contact and measure1
Editors’ note: Special issue on combining probability and logic1
Minimal degrees and downwards density in some strong positive reducibilities and quasi-reducibilities1
Algorithmic properties of modal and superintuitionistic logics of monadic predicates over finite Kripke frames1
Noetherian Gödel logics1
Some results on relation algebra reducts: Residuated and semilattice-ordered semigroups1
Consistency and permission in deontic justification logic1
Computing most general unifiers in Euclidean modal logics1
ASP-based approaches for solving the nuclear medicine scheduling problem1
The provability logic of all provability predicates1
Copying safety and liveness properties of computational artefacts1
Renovation sets and their applications in higher-order argumentation frameworks1
Fuzzy labelling semantics for quantitative argumentation1
Evaluative presentations1
On subreducts of subresiduated lattices and some related logics1
Modeling dynamics of legal relations with dynamic logic1
On tense bounded Hilbert algebras with supremum1
Effective inseparability and some applications in meta-mathematics1
Coarsening natural deduction proofs II: finding gaunt proofs1
Tailoring explanations through conversation1
A Stone-type duality for semilattices with adjunctions1
Conditional probabilities as degrees of similarity and as degrees of entailment1
A logic with probabilistic Jaccard similarity1
Handling irresolvable conflicts in the Semantic Web: an RDF-based conflict-tolerant version of the Deontic Traditional Scheme1
Proceedings of the XX Encontro Brasileiro de Lógica1
How to leverage intelligent agents and complex event processing to improve patient monitoring1
Decompositions of stratified institutions1
Degrees of truthlikeness, independence, equality and order in probabilistic propositional knowledge representation1
Semitopology: a topological approach to decentralized collaborative action1
A Principle-based Account of Self-attacking Arguments in Gradual Semantics1
Timed concurrent language for argumentation with maximum parallelism1
The Expressivity of Quantified Group Announcements1
Defining logical systems via algebraic constraints on proofs1
Preface1
27th Workshop on Logic, Language, Information and Computation - WoLLIC 20211
Modal structures in groups and vector spaces1
Computational properties of finite PNmatrices1
Probabilistic consequence relations1
Contribution to decision-making in the big data industry based on the multiparametric similarity measure for Pythagorean fuzzy sets1
A credulous semantics of higher-order argumentation frameworks based on credulously accepted attacks1
Explicit non-normal modal logic1
Fuzzy bi-Gödel modal logic and its paraconsistent relatives1
A unified logical framework for explanations in classifier systems1
A representation theory for modal distributive lattices1
Epistemic state updates in LLM agents via public announcement and graded modal logic1
Reconciling transparency, low Δ0-complexity and axiomatic weakness in undecidability proofs1
Correction to: Minimal degrees and downwards density in some strong positive reducibilities and quasi-reducibilities1
Undecidability of the degree structure of primitive recursive m-reducibility1
A logical framework to model software development by multiple agents following a common specification1
Towards ILP-based LTLf passive learning1
Correction to: Argumentation Frameworks with Attack Classification1
Generalization of filter theory of EQ-algebras based on lattices1
A categorical analysis of compatibility frames1
Special issue for the 36th Italian Conference on Computational Logic (CILC 2021)1
Nonmonotonic inferences: Classical conclusions in an intuitionistic modal framework1
Modal algebra of multirelations1
On the conservation results for local reflection principles0
Deductive databases in four-valued logic: rule semantics and models0
The Ackermann encoding and its siblings0
On the computational properties of basic mathematical notions0
Coherence via focusing for symmetric skew monoidal and symmetric skew closed categories0
Computing minimal unsatisfiable core for LTL over finite traces0
Low scattered linear orders0
On an inferential semantics for intuitionistic sentential logic0
A correct-by-construction approach for development of reliable planning problems0
Hamilton’s cumular conception of quantifying particles: an exercise in third-order logic0
Solving quantified modal logic problems by translation to classical logics0
A Logic for Desire Based on Causal Inference0
Logics for at most countable first-order structures0
Reconstructing a single-head formula to facilitate logical forgetting0
Limitations of the invertible-map equivalences0
Belief change based on knowledge measures0
(Conceptual) explanations in logic0
Rescheduling rehabilitation sessions with answer set programming0
Advancing Logic in AI: insights from the LNGAI 2021 Workshop0
Master Surgical Scheduling via Answer Set Programming0
Correction to: The mathematics of Epstein semantics0
Deontic meta-rules0
Some completeness results in derivational modal logic0
Probability and natural deduction0
Uniform interpolation via nested sequents and hypersequents0
Techniques for measuring the inferential strength of forgetting policies0
Extracting efficient exact real number computation from proofs in constructive type theory0
Analogues of Shepherdson’s Theorem for a language with exponentiation0
Algebraic tools for default modal systems0
Smullyan’s truth and provability0
On syntactic concept lattice models for the Lambek calculus and infinitary action logic0
A comparison of imprecise Bayesianism and Dempster–Shafer theory for automated decisions under ambiguity0
Completeness of tableau calculi for two-dimensional hybrid logics0
An algebraic extension of intuitionistic linear logic: the ????!????-calculus and its categorical model0
Editorial0
Uniform Lyndon interpolation for the pure logic of necessitation with a modal reduction principle0
What do ultraproducts remember about the original structures?0
Numerical expressive power of logical languages with cardinality comparison0
Kettle logic in abstract argumentation0
Constructive and mechanised meta-theory of IEL and similar modal logics0
Attack principles in sequent-based argumentation theory0
A comparison of three kinds of monotonic proof-theoretic semantics and the base-incompleteness of intuitionistic logic0
Logics with probabilistic team semantics and the Boolean negation0
Descriptive complexity for distributed computing with circuits0
Completeness in partial type theory0
Weak relevant justification logics0
Constraint propagation on GPU: A case study for the AllDifferent constraint0
There are no minimal essentially undecidable theories0
Classical reasoning in the justification paradigm0
Preface0
Correction to: Arithmetical and Hyperarithmetical Worm Battles0
Computational considerations on the representation of number-theoretic functions by arithmetic terms0
Sequent calculi and an efficient theorem prover for conditional logics with selection function semantics0
Recursive rules with aggregation: a simple unified semantics0
A formal framework for reasoning about agents’ independence in self-organizing multi-agent systems0
A Gödel-Dugundji-style theorem for the minimal structural logic0
A many-valued multi-preferential propositional typicality logic and a conditional interpretation for gradual argumentation0
Editorial: Special issue from the 3rd International Workshop on Dynamic Logic: New Trends and Applications (DaLí 2020)0
On the realisability of weak argumentation semantics0
Relations enumerable from positive information0
Bipolar Argumentation Frameworks with a dual relation between defeat and defence0
Interpolating between the Jaccard distance and an analogue of the normalized information distance0
Did Turing prove the undecidability of the halting problem?0
Generic logical encoding for argumentation0
Analyticity with extra-logical information0
Some applications of Baaz’s generalization method to the study of the factors of Fermat numbers0
Tractable depth-bounded approximations to FDE and its satellites0
Knowledge injection of Datalog rules via Neural Network Structuring with KINS0
On quasi-reducibility for c.e. sets Part I. The structure of the Q -degrees and the sQ -degrees0
Soundness and completeness results for LEA and probability semantics0
Netreason: Reasoning about social networks0
Nonconservative extensions by propositional quantifiers and modal incompleteness0
Relevant epistemic logic with public announcements and common knowledge0
☐ and ◇ in eight-valued non-deterministic semantics for modal logics0
Projective relative unification through duality0
Coarsening Natural Deduction Proofs I: Finding Perfect Proofs0
The umbilical cord of finite model theory0
To the logical foundations of random number generator construction0
An alternative definition of tense operators on residuated lattices0
Heuristic algorithms for credulous and sceptical reasoning problems in abstract argumentation0
A formal, diagrammatic, and operational study of normative relations0
Applying Theory to Practice0
Dialectica logical principles: not only rules0
Separability and harmony in ecumenical systems0
Implicative-ortholattices as orthogonality spaces0
An EXPTIME-complete entailment problem in separation logic0
Modal logic with relations over paths: A theoretical development through comonadic semantics0
Linear logic in a refutational setting0
Sustainable goal-oriented smart environments: a declarative programming approach0
Polytime embedding of intuitionistic modal logics into their one-variable fragments0
On probabilistic and causal reasoning with summation operators0
Expanding the Leibniz Hierarchy0
Correction to: Modalities combining two negations0
Nash meets Łukasiewicz: computing equilibria through logic0
Editorial: special issue on the Australasian Logic Colloquium 20230
MV-frames0
A finitary outer measure logic0
Strict-tolerant conditional logics0
AL+: Extended argumentation logic0
Herbrand analyses in geometry: A case study0
Remarks on skew Hilbert algebras and weak BCK*-algebras0
Extension-based semantics for incomplete argumentation frameworks: properties, complexity and algorithms0
Tarskian theories of Krivine’s classical realizability0
Tame and full strict-Π11 reflection: A proof-theoretic approach0
0.087926864624023