On the public citation graph
MOLOG: A system that extends PROLOG with modal logic
0 signed · 93 inferred · view as graph
Inferred edges come from two machine sources: sweeps of open repository metadata (mostly SSRN and Zenodo), and a bulk OpenAlex citation snapshot. Every row below is labelled with the one it came from. Neither is a complete citation index — absence here is not evidence of absence.
Is this your work? Sign in with ORCID and put your name on the
claims that are yours.
Reference health. See whether every reference in this work resolves to a
known work and none has been retracted — and get a dated CiteStamped
badge you can embed.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1007/3-540-10009-1_1openalex-snapshot
Using meta-theoretic reasoning to do algebra
inferredcites →https://doi.org/10.1016/0020-0190(82)90085-0openalex-snapshot
A simple deduction method for modal logic
inferredcites →https://doi.org/10.1016/0743-1066(84)90029-3openalex-snapshot
N-Prolog: An extension of Prolog with hypothetical implications. I.
inferredcites →https://doi.org/10.3233/fi-1980-3209openalex-snapshot
Resolution systems and their applications I
What points at this work
Incoming claims: where this work appears in other papers’ reference lists and arguments.
inferred← citeshttps://doi.org/10.1002/scj.4690210610openalex-snapshot
Automated Design of Circuits from Recursion Equations Using Theorem‐Proving Technique
inferred← citeshttps://doi.org/10.1007/11560647_10openalex-snapshot
An SLD-Resolution Calculus for Basic Serial Multimodal Logics
inferred← citeshttps://doi.org/10.1007/11750734_3openalex-snapshot
Reasoning About Epistemic States of Agents by Modal Logic Programming
inferred← citeshttps://doi.org/10.1007/3-540-17187-8_33openalex-snapshot
Update semantics under the domain closure assumption
inferred← citeshttps://doi.org/10.1007/3-540-18024-9_24openalex-snapshot
Programming in modal logic: An extension of PROLOG based on modal logic
inferred← citeshttps://doi.org/10.1007/3-540-48317-9_2openalex-snapshot
Logic-Based Knowledge Representation
inferred← citeshttps://doi.org/10.1007/3-540-52335-9_55openalex-snapshot
Gentzen-type systems and resolution rules part I propositional logic
inferred← citeshttps://doi.org/10.1007/3-540-53162-9_30openalex-snapshot
Multi-modal logic programming using equational and order-sorted logic
inferred← citeshttps://doi.org/10.1007/3-540-54563-8_108openalex-snapshot
Amalgamated logic programming and non-monotonic reasoning
inferred← citeshttps://doi.org/10.1007/3-540-55460-2_28openalex-snapshot
Gentzen-type calculi for modal logic S4 with barcan formula
inferred← citeshttps://doi.org/10.1007/3-540-56282-6_2openalex-snapshot
Metaprogramming through intensional deduction: Some examples
inferred← citeshttps://doi.org/10.1007/3-540-58976-7_1openalex-snapshot
An introduction to executable modal and temporal logics
inferred← citeshttps://doi.org/10.1007/3-540-58976-7_2openalex-snapshot
Temporal logic programming with metric and past operators
inferred← citeshttps://doi.org/10.1007/3-540-58976-7_9openalex-snapshot
Solving air-traffic problems with “possible worlds”
inferred← citeshttps://doi.org/10.1007/3-540-60983-0_2openalex-snapshot
Translating a modal language with embedded implication into Horn clause logic
inferred← citeshttps://doi.org/10.1007/3-540-61291-2_69openalex-snapshot
Negoplan: A system for logic-based decision modelling
inferred← citeshttps://doi.org/10.1007/978-3-030-75775-5_22openalex-snapshot
Tractable Reasoning Using Logic Programs with Intensional Concepts
inferred← citeshttps://doi.org/10.1007/978-3-031-56595-3_8openalex-snapshot
Many-Valued Modalities and Paraconsistency
inferred← citeshttps://doi.org/10.1007/978-3-540-27775-0_42openalex-snapshot
MProlog: An Extension of Prolog for Modal Logic Programming
inferred← citeshttps://doi.org/10.1007/978-3-540-30227-8_24openalex-snapshot
The Modal Logic Programming System MProlog
inferred← citeshttps://doi.org/10.1007/978-3-540-89784-2_8openalex-snapshot
Representing and Validating Digital Business Processes
inferred← citeshttps://doi.org/10.1007/978-3-642-40564-8_3openalex-snapshot
Integrating Temporal Extensions of Answer Set Programming
inferred← citeshttps://doi.org/10.1007/978-3-642-40564-8_33openalex-snapshot
Game Semantics for Non-monotonic Intensional Logic Programming
inferred← citeshttps://doi.org/10.1007/978-94-011-4040-9_2openalex-snapshot
Normal Multimodal Logics with Interaction Axioms
inferred← citeshttps://doi.org/10.1007/bf00117746openalex-snapshot
Reasoning about reasoning in a meta-level architecture
inferred← citeshttps://doi.org/10.1007/bf00249021openalex-snapshot
Programming in temporal-nonmonotonic reasoning
inferred← citeshttps://doi.org/10.1007/bf00302639openalex-snapshot
Strategies for modal resolution: Results and problems
inferred← citeshttps://doi.org/10.1007/bf00993253openalex-snapshot
Higher-order and modal logic as a framework for explanation-based generalization
inferred← citeshttps://doi.org/10.1007/bf03037512openalex-snapshot
An epistemic model of logic programming
inferred← citeshttps://doi.org/10.1007/bfb0013544openalex-snapshot
Tim: The toulouse inference machine for non-classical logic programming
inferred← citeshttps://doi.org/10.1007/bfb0014004openalex-snapshot
An overview of temporal and modal logic programming
inferred← citeshttps://doi.org/10.1007/bfb0034803openalex-snapshot
PROMAL: Programming in modal action logic
inferred← citeshttps://doi.org/10.1007/bfb0053032openalex-snapshot
Combining object-oriented and logic paradigms: A modal logic programming approach
inferred← citeshttps://doi.org/10.1007/s10817-010-9167-0openalex-snapshot
Resolution with Order and Selection for Hybrid Logics
inferred← citeshttps://doi.org/10.1016/0020-0190(93)90014-zopenalex-snapshot
The computational complexity of satisfiability of temporal Horn formulas in propositional linear-time temporal logic
inferred← citeshttps://doi.org/10.1016/0304-3975(89)90137-0openalex-snapshot
Modal resolution in clausal form
inferred← citeshttps://doi.org/10.1016/0304-3975(91)90181-zopenalex-snapshot
Resolution for some first-order modal systems
inferred← citeshttps://doi.org/10.1016/0304-3975(92)90290-vopenalex-snapshot
Multimodal logic programming using equational and order-sorted logic
inferred← citeshttps://doi.org/10.1016/0304-3975(94)90082-5openalex-snapshot
The computational complexity of the satisfiability of modal Horn clauses for modal propositional logics
inferred← citeshttps://doi.org/10.1016/0743-1066(87)90018-5openalex-snapshot
A note on the complexity of the satisfiability of modal Horn clauses
inferred← citeshttps://doi.org/10.1016/0743-1066(92)90007-popenalex-snapshot
Theory of generalized annotated logic programming and its applications**A preliminary report on this research has appeared in [34].
inferred← citeshttps://doi.org/10.1016/0743-1066(92)90055-8openalex-snapshot
Towards a unified theory of intensional logic programming
inferred← citeshttps://doi.org/10.1016/0743-1066(94)90001-9openalex-snapshot
Structuring logic programs: a modal approach
inferred← citeshttps://doi.org/10.1016/0888-613x(93)90019-aopenalex-snapshot
Proof methods for reasoning about possibility and necessity
inferred← citeshttps://doi.org/10.1016/j.apal.2016.10.005openalex-snapshot
Game semantics for non-monotonic intensional logic programming
inferred← citeshttps://doi.org/10.1016/j.jal.2015.06.003openalex-snapshot
Logic programming as classical inference
inferred← citeshttps://doi.org/10.1016/j.tcs.2006.03.026openalex-snapshot
Multimodal logic programming
inferred← citeshttps://doi.org/10.1016/s0020-7373(05)80047-1openalex-snapshot
Foundations of declarative debugging in arbitrary logic programming
inferred← citeshttps://doi.org/10.1016/s0304-3975(97)00048-0openalex-snapshot
Multi-dimensional logic programming: theoretical foundations
inferred← citeshttps://doi.org/10.1016/s0304-3975(97)00139-4openalex-snapshot
Programming in metric temporal logic
inferred← citeshttps://doi.org/10.1016/s1570-2464(07)80007-3openalex-snapshot
4 Computational modal logic
inferred← citeshttps://doi.org/10.1017/s1471068415000307openalex-snapshot
An infinitary encoding of temporal equilibrium logic
inferred← citeshttps://doi.org/10.1017/s1471068421000557openalex-snapshot
Linear-Time Temporal Answer Set Programming
inferred← citeshttps://doi.org/10.1023/a:1005077431494openalex-snapshot
Algorithmic Proof Methods and Cut Elimination for Implicational Logics Part I: Modal Implication
inferred← citeshttps://doi.org/10.1023/a:1022676712939openalex-snapshot
Higher-Order and Modal Logic as a Framework for Explanation-Based Generalization
inferred← citeshttps://doi.org/10.1046/j.0824-7935.2003.00221.xopenalex-snapshot
Microplanning with Communicative Intentions: The SPUD System
inferred← citeshttps://doi.org/10.1080/00207169508804444openalex-snapshot
Foundations of linear-time logic programming
inferred← citeshttps://doi.org/10.1080/11663081.2018.1427987openalex-snapshot
Temporal Equilibrium Logic with past operators
inferred← citeshttps://doi.org/10.1093/jigpal/jzp080openalex-snapshot
Multimodal and intuitionistic logics in simple type theory
inferred← citeshttps://doi.org/10.1109/hicss.1988.11909openalex-snapshot
A computational logic for incomplete and distributed knowledge based systems
inferred← citeshttps://doi.org/10.1109/icci.1993.315313openalex-snapshot
Chronolog(Z): linear-time logic programming
inferred← citeshttps://doi.org/10.1109/ismvl.1989.37779openalex-snapshot
Foundations of fuzzy logic programming and debugging
inferred← citeshttps://doi.org/10.1109/micai.2012.11openalex-snapshot
A Dynamic Logic-Based Modal Prolog
inferred← citeshttps://doi.org/10.1111/1467-8640.00221openalex-snapshot
Microplanning with Communicative Intentions: The SPUD System
inferred← citeshttps://doi.org/10.1111/j.1467-8640.1988.tb00279.xopenalex-snapshot
Representation and combination of uncertainty with belief functions and possibility measures
inferred← citeshttps://doi.org/10.1111/j.1467-8640.1995.tb00045.xopenalex-snapshot
AN EPISTEMIC LOGIC WITH QUANTIFICATION OVER NAMES
inferred← citeshttps://doi.org/10.1145/1071596.1071599openalex-snapshot
Disjunction and modular goal-directed proof search
inferred← citeshttps://doi.org/10.1145/2528931openalex-snapshot
Logical foundations for more expressive declarative temporal logic programming languages
inferred← citeshttps://doi.org/10.1145/75277.75301openalex-snapshot
Temporal logic programming is complete and expressive
inferred← citeshttps://doi.org/10.12775/llp.2001.008openalex-snapshot
A meta-interpreter based on paraconsistent legal knowledge engineering
inferred← citeshttps://doi.org/10.1590/1981-5344/2532openalex-snapshot
Ontoprolog: uma linguagem para especificação de discursos sobre ontologias
inferred← citeshttps://doi.org/10.20868/upm.thesis.46778openalex-snapshot
Síntesis de protocolos de comunicación a partir de especificaciones de servicio
inferred← citeshttps://doi.org/10.3115/976815.976827openalex-snapshot
Programming in logic with constraints for natural language processing
inferred← citeshttps://doi.org/10.3166/jancl.13.133-164openalex-snapshot
CWA Extensions to Multi-Valued Logics
inferred← citeshttps://doi.org/10.3166/jancl.19.167-181openalex-snapshot
Modal logic programming revisited
inferred← citeshttps://doi.org/10.3166/rig.2016.00007openalex-snapshot
Raisonner en logique modale sur l’incertitude liée aux données
inferred← citeshttps://doi.org/10.48550/arxiv.1905.06184openalex-snapshot
Extensions to Justification Theory
inferred← citeshttps://doi.org/10.48550/arxiv.2009.06544openalex-snapshot
Temporal Answer Set Programming
inferred← citeshttps://doi.org/10.48550/arxiv.cs/0104021openalex-snapshot
Disjunction and modular goal-directed proof search
Editorial review for independent work. ICSAC — the Institute for Complexity
Science and Advanced Computing — runs a structured editorial panel for researchers
publishing outside journals, and publishes on CiteStamp rails. Submission is free
and goes through ORCID: icsacinstitute.org/submit.