On the public citation graph

Horn clause computability

https://doi.org/10.1007/bf01932293

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.

Claim with ORCID

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.

See reference health

What this work says

Outgoing claims: the papers this work cites, builds on, or argues with.

inferredcites →https://doi.org/10.1093/comjnl/3.2.75openalex-snapshot

Information Processing

inferredcites →https://doi.org/10.1112/plms/s2-43.6.544openalex-snapshot

On Computable Numbers, with an Application to the Entscheidungsproblem. A Correction

inferredcites →https://doi.org/10.1145/321250.321253openalex-snapshot

A Machine-Oriented Logic Based on the Resolution Principle

What points at this work

Incoming claims: where this work appears in other papers’ reference lists and arguments.

inferred← citeshttps://doi.org/10.1007/11680093_5openalex-snapshot

An Algorithm for Local Variable Elimination in Normal Logic Programs

inferred← citeshttps://doi.org/10.1007/3-540-15198-2_24openalex-snapshot

Why Horn formulas matter in computer science: Initial structures and generic examples

inferred← citeshttps://doi.org/10.1007/3-540-16492-8_61openalex-snapshot

The role of logic programming in the Fifth Generation Computer Project

inferred← citeshttps://doi.org/10.1007/3-540-16492-8_78openalex-snapshot

Some issues and trends in the semantics of logic programming

inferred← citeshttps://doi.org/10.1007/3-540-16492-8_91openalex-snapshot

Equivalences of logic programs

inferred← citeshttps://doi.org/10.1007/3-540-44957-4_8openalex-snapshot

Binary Speed Up for Logic Programs

inferred← citeshttps://doi.org/10.1007/3-540-53507-1_99openalex-snapshot

Static estimation of query sizes in horn programs

inferred← citeshttps://doi.org/10.1007/3-540-55437-8_88openalex-snapshot

Negation in conclog

inferred← citeshttps://doi.org/10.1007/3-540-55719-9_100openalex-snapshot

On the complexity of dataflow analysis of logic programs

inferred← citeshttps://doi.org/10.1007/3-540-59155-9_12openalex-snapshot

Imagining CLP(Λ,≡αβ)

inferred← citeshttps://doi.org/10.1007/978-1-4612-4984-9_10openalex-snapshot

Applied Logic

inferred← citeshttps://doi.org/10.1007/978-1-4684-3384-5_10openalex-snapshot

An Axiomatic Data Base Theory

inferred← citeshttps://doi.org/10.1007/978-3-030-19570-0_17openalex-snapshot

SLD-Resolution Reduction of Second-Order Horn Fragments

inferred← citeshttps://doi.org/10.1007/978-3-032-09087-4_8openalex-snapshot

Active Learning of Digenic Functions with Boolean Matrix Logic Programming

inferred← citeshttps://doi.org/10.1007/978-3-540-74615-7_1openalex-snapshot

Foundations of Rule-Based Query Answering

inferred← citeshttps://doi.org/10.1007/978-3-540-78739-6_11openalex-snapshot

Iterative Specialisation of Horn Clauses

inferred← citeshttps://doi.org/10.1007/978-3-540-92910-9_34openalex-snapshot

Molecular Computing Machineries — Computing Models and Wet Implementations

inferred← citeshttps://doi.org/10.1007/978-3-642-20832-4_21openalex-snapshot

Answer Set; Programming?

inferred← citeshttps://doi.org/10.1007/978-94-009-5044-3_2openalex-snapshot

Theoretical Issues of Logic Programming

inferred← citeshttps://doi.org/10.1007/978-94-011-2496-6_3openalex-snapshot

Complexity of Logical Decision Problems: An Introduction

inferred← citeshttps://doi.org/10.1007/978-981-96-0026-7_2openalex-snapshot

Computable Relations Mapping with Horn Clauses for Inductive Program Synthesis

inferred← citeshttps://doi.org/10.1007/bf01078915openalex-snapshot

Automatic theorem proving. II

inferred← citeshttps://doi.org/10.1007/bf01101651openalex-snapshot

Semantics of algorithmic languages

inferred← citeshttps://doi.org/10.1007/bf01228878openalex-snapshot

An introduction to deductive database languages and systems

inferred← citeshttps://doi.org/10.1007/bf01536403openalex-snapshot

How expressive is stratified aggregation?

inferred← citeshttps://doi.org/10.1007/bf01536404openalex-snapshot

On computability by logic programs

inferred← citeshttps://doi.org/10.1007/bf02186359openalex-snapshot

A selected artificial intelligence bibliography for operations researchers

inferred← citeshttps://doi.org/10.1007/bf03037300openalex-snapshot

Towards a logic programming methodology based on higher-order predicates

inferred← citeshttps://doi.org/10.1007/bf03037409openalex-snapshot

Logic program forms

inferred← citeshttps://doi.org/10.1007/bf03037455openalex-snapshot

The role of logic programming in the Fifth Generation Computer Project

inferred← citeshttps://doi.org/10.1007/bfb0015938openalex-snapshot

The limitations of partial evaluation

inferred← citeshttps://doi.org/10.1007/bfb0020826openalex-snapshot

A modal semantics for the negation as failure and the closed world assumption rules

inferred← citeshttps://doi.org/10.1007/bfb0030386openalex-snapshot

A tutorial on Nonmonotonic Reasoning

inferred← citeshttps://doi.org/10.1007/bfb0035796openalex-snapshot

Horn programs and semicomputable relations on abstract structures

inferred← citeshttps://doi.org/10.1007/s10994-014-5471-yopenalex-snapshot

Meta-interpretive learning of higher-order dyadic datalog: predicate invention revisited

inferred← citeshttps://doi.org/10.1007/s10994-019-05834-xopenalex-snapshot

Logical reduction of metarules

inferred← citeshttps://doi.org/10.1007/s10994-020-05934-zopenalex-snapshot

Learning programs by learning from failures

inferred← citeshttps://doi.org/10.1016/0020-0190(82)90096-5openalex-snapshot

Grammatical unification

inferred← citeshttps://doi.org/10.1016/0020-0190(84)90113-3openalex-snapshot

A new combination of input and unit deductions for Horn sentences

inferred← citeshttps://doi.org/10.1016/0020-0190(86)90136-5openalex-snapshot

Resolution deduction to detect satisfiability for another class including non-horn sentences in propositional logic

inferred← citeshttps://doi.org/10.1016/0020-0190(88)90072-5openalex-snapshot

Logic programming with external procedures: introducing S-unification

inferred← citeshttps://doi.org/10.1016/0022-0000(87)90027-4openalex-snapshot

Why horn formulas matter in computer science: Initial structures and generic examples

inferred← citeshttps://doi.org/10.1016/0167-6423(88)90069-xopenalex-snapshot

Computability theory, semantics and logic programming

inferred← citeshttps://doi.org/10.1016/0304-3975(94)00227-aopenalex-snapshot

Unfolding-definition-folding, in this order, for avoiding unnecessary variables in logic programs

inferred← citeshttps://doi.org/10.1016/0743-1066(84)90028-1openalex-snapshot

Transformations of logic programs

inferred← citeshttps://doi.org/10.1016/0743-1066(87)90014-8openalex-snapshot

Unification as a complexity measure for logic programming

inferred← citeshttps://doi.org/10.1016/0743-1066(88)90016-7openalex-snapshot

Toward a declarative semantics for infinite objects in logic programming

inferred← citeshttps://doi.org/10.1016/0743-1066(92)90020-4openalex-snapshot

Deterministic and nondeterministic computation, and horn programs, on abstract data types

inferred← citeshttps://doi.org/10.1016/0743-1066(93)90007-4openalex-snapshot

Success and failure for hereditary Harrop formulae

inferred← citeshttps://doi.org/10.1016/0743-1066(94)00030-aopenalex-snapshot

Depth-bounded bottom-up evaluation of logic programs

inferred← citeshttps://doi.org/10.1016/0743-1066(95)00122-0openalex-snapshot

Smallest horn clause programs

inferred← citeshttps://doi.org/10.1016/b978-0-444-88074-1.50015-9openalex-snapshot

Logic Programming

inferred← citeshttps://doi.org/10.1016/b978-0-934613-40-8.50005-1openalex-snapshot

Negation in Logic Programming

inferred← citeshttps://doi.org/10.1016/b978-0-934613-40-8.50006-3openalex-snapshot

Towards a Theory of Declarative Knowledge

inferred← citeshttps://doi.org/10.1016/b978-0-934613-40-8.50020-8openalex-snapshot

Equivalences of Logic Programs

inferred← citeshttps://doi.org/10.1016/s0019-9958(83)80027-8openalex-snapshot

The satisfiabilty problem for a class consisting of horn sentences and some non-horn sentences in proportional logic

inferred← citeshttps://doi.org/10.1016/s0049-237x(08)70326-4openalex-snapshot

Bibliography

inferred← citeshttps://doi.org/10.1016/s0743-1066(98)10038-9openalex-snapshot

A pragmatic reconstruction of λProlog

inferred← citeshttps://doi.org/10.1017/s147106840300190xopenalex-snapshot

Speedup of logic programs by binarization and partial deduction

inferred← citeshttps://doi.org/10.1017/s1471068410000244openalex-snapshot

Disjunctive ASP with functions: Decidable queries and effective computation

inferred← citeshttps://doi.org/10.1017/s1471068421000211openalex-snapshot

Analysis and Transformation of Constrained Horn Clauses for Program Verification

inferred← citeshttps://doi.org/10.1017/s1471068421000533openalex-snapshot

A Survey of the Proof-Theoretic Foundations of Logic Programming

inferred← citeshttps://doi.org/10.1023/a:1009893911892openalex-snapshot

Horn Clause Computation with DNA Molecules

inferred← citeshttps://doi.org/10.1038/nnano.2009.203openalex-snapshot

Molecular implementation of simple logic programs

inferred← citeshttps://doi.org/10.1080/09528139408953789openalex-snapshot

A metalogic programming approach: language, semantics and applications

inferred← citeshttps://doi.org/10.1109/ccc.1997.612304openalex-snapshot

Complexity and expressive power of logic programming

inferred← citeshttps://doi.org/10.1109/ecai54874.2022.9847508openalex-snapshot

An Ontology-Based Framework for Formal Verification of Safety and Security Properties of Control Logics

inferred← citeshttps://doi.org/10.1109/eurosp.2016.21openalex-snapshot

Translingual Obfuscation

inferred← citeshttps://doi.org/10.1109/icde.2009.52openalex-snapshot

Deductive Framework for Programming Sensor Networks

inferred← citeshttps://doi.org/10.1109/icec.1997.592298openalex-snapshot

DNA implementation of simple Horn clause computation

inferred← citeshttps://doi.org/10.1109/seconw.2018.8396347openalex-snapshot

Deductive Approach to Processing High-Level Video Activity Queries in UAV Networks

inferred← citeshttps://doi.org/10.1111/j.1467-8640.1988.tb00288.xopenalex-snapshot

Exhuming the criticism of the logicist

inferred← citeshttps://doi.org/10.1145/101371.101373openalex-snapshot

A new proof of undecidability of safety of logic queries

inferred← citeshttps://doi.org/10.1145/151634.151635openalex-snapshot

Finite representation of infinite query answers

inferred← citeshttps://doi.org/10.1145/201059.201068openalex-snapshot

On the complexity of dataflow analysis of logic programs

inferred← citeshttps://doi.org/10.1145/275487.275515openalex-snapshot

Complexity of nonrecursive logic programs with complex values

inferred← citeshttps://doi.org/10.1145/315891.316021openalex-snapshot

An alternative transformation rule for logic programs

inferred← citeshttps://doi.org/10.1145/331119.331145openalex-snapshot

On quantitative measurement of negation in logic programming

inferred← citeshttps://doi.org/10.1145/502807.502810openalex-snapshot

Complexity and expressive power of logic programming

inferred← citeshttps://doi.org/10.1145/51594.51597openalex-snapshot

Using Prolog to present abstract machines

inferred← citeshttps://doi.org/10.1613/jair.1.13507openalex-snapshot

Inductive Logic Programming At 30: A New Introduction

inferred← citeshttps://doi.org/10.2307/414538openalex-snapshot

Prolog and natural language analysis . By Fernando C.N. Pereira and Stuart M. Shieber (CSLI Lecture Notes 10.) Stanford: Center for the Study of Language and Information, 1987. Pp. viii, 266.

inferred← citeshttps://doi.org/10.23919/mipro.2018.8400171openalex-snapshot

Some logic and related formalisms, programming paradigms, and development environments for the (new) AI

inferred← citeshttps://doi.org/10.25560/24553openalex-snapshot

Logic Programs as Declarative and Procedural Bias in Inductive Logic Programming

inferred← citeshttps://doi.org/10.48550/arxiv.0810.5056openalex-snapshot

P is not equal to NP

inferred← citeshttps://doi.org/10.48550/arxiv.1902.09900openalex-snapshot

SLD-Resolution Reduction of Second-Order Horn Fragments -- technical report --

inferred← citeshttps://doi.org/10.5109/13374openalex-snapshot

REPRESENTATION THEOREMS AND PRIMITIVE PREDICATES FOR LOGIC PROGRAMS

inferred← citeshttps://doi.org/10.70675/3c7efdf6z206cz4554z9fcbz4239a3c4953eopenalex-snapshot

Developing proof theory for proof exchange

inferred← citeshttps://doi.org/10.70675/b4c0626bz63d7z4842z82d1zb1c33f09cec0openalex-snapshot

Pour une cohérence du résultat d'un opérateur dans un contexte spatial, temporel et alphanumérique

inferred← citeshttps://doi.org/10.70675/cdbc9d15zedccz471az9398zed83a64b5068openalex-snapshot

A preference-based approach to machine ethics for automated planning

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.