On the public citation graph

Logic programming with strong negation

0 signed · 63 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.1002/malq.19740201903openalex-snapshot

The Notion of Logical Consequence in the Logic of Inexact Predicates

inferredcites →https://doi.org/10.1007/978-94-010-1161-7_2openalex-snapshot

A Useful Four-Valued Logic

inferredcites →https://doi.org/10.1016/0304-3975(89)90126-6openalex-snapshot

Paraconsistent logic programming

inferredcites →https://doi.org/10.1016/0743-1066(84)90011-6openalex-snapshot

Making prolog more expressive

inferredcites →https://doi.org/10.1016/0743-1066(86)90002-6openalex-snapshot

Negation as inconsistency. I

inferredcites →https://doi.org/10.1016/0743-1066(86)90006-3openalex-snapshot

Pressing for parallelism: a PROLOG program made Concurrent

inferredcites →https://doi.org/10.1016/0743-1066(89)90031-9openalex-snapshot

A logical analysis of modules in logic programming

inferredcites →https://doi.org/10.1016/s0049-237x(09)70653-6openalex-snapshot

What is Negation in a System?

inferredcites →https://doi.org/10.1016/s0049-237x(09)x7004-7openalex-snapshot

An Algebraic Approach to Non-Classical Logics

inferredcites →https://doi.org/10.1016/s0743-1066(85)80005-4openalex-snapshot

A kripke-kleene semantics for logic programs*

inferredcites →https://doi.org/10.1017/cbo9780511526602openalex-snapshot

Logic and Computation

inferredcites →https://doi.org/10.1093/logcom/1.6.835openalex-snapshot

Logic Programming with Strong Negation and Inexact Predicates

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

The British Nationality Act as a logic program

inferredcites →https://doi.org/10.2307/2183585openalex-snapshot

Experience and Theory.

inferredcites →https://doi.org/10.2307/2274105openalex-snapshot

Constructible falsity and inexact predicates

inferredcites →https://doi.org/10.3233/fi-1988-11206openalex-snapshot

Logic Programming on a Topological Bilattice1

What points at this work

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

inferred← citeshttps://doi.org/10.1007/11546207_27openalex-snapshot

Routley Semantics for Answer Sets

inferred← citeshttps://doi.org/10.1007/3-540-56804-2_1openalex-snapshot

On extended disjunctive logic programs

inferred← citeshttps://doi.org/10.1007/3-540-58792-6_18openalex-snapshot

Logic programs with tests

inferred← citeshttps://doi.org/10.1007/3-540-63255-7_18openalex-snapshot

A paraconsistent semantics with contradiction support detection

inferred← citeshttps://doi.org/10.1007/978-3-540-30124-0_37openalex-snapshot

A Space Efficient Implementation of a Tableau Calculus for a Logic with a Constructive Negation

inferred← citeshttps://doi.org/10.1007/978-3-642-04238-6_27openalex-snapshot

Belief Logic Programming: Uncertainty Reasoning with Correlation of Evidence

inferred← citeshttps://doi.org/10.1007/978-3-642-04388-8_21openalex-snapshot

Query Answering in Belief Logic Programming

inferred← citeshttps://doi.org/10.1007/978-3-642-23580-1_14openalex-snapshot

On the Equivalence between the $\mathcal{L}_1$ Action Language and Partial Actions in Transaction Logic

inferred← citeshttps://doi.org/10.1007/978-3-642-23580-1_15openalex-snapshot

Reasoning with Actions in Transaction Logic

inferred← citeshttps://doi.org/10.1007/978-3-642-28472-4_19openalex-snapshot

Formalizing Production Systems with Rule-Based Ontologies

inferred← citeshttps://doi.org/10.1007/978-3-642-51136-3_15openalex-snapshot

TMPR for Disjunctive Logic Programming and Usefulness of Strong and Exclusion Negation

inferred← citeshttps://doi.org/10.1007/978-3-642-60211-5_18openalex-snapshot

Logic and Databases: a 20 Year Retrospective -Updated in Honor of Ray Reiter

inferred← citeshttps://doi.org/10.1007/978-94-011-5638-7_1openalex-snapshot

Recent Issues in Logic, Language and Computation

inferred← citeshttps://doi.org/10.1007/978-94-017-1739-7_8openalex-snapshot

A Survey of Paraconsistent Semantics for Logic Programs

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

Model theoretic approach to view updates in deductive databases

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

Disjunctive logic programming, constructivity and strong negation

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

Tableaux for logic programming with strong negation

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

Logic and databases: A 20 year retrospective

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

Reasoning with negative information, II: Hard negation, strong negation and logic programs

inferred← citeshttps://doi.org/10.1007/s00153-022-00821-xopenalex-snapshot

Disjunctive logic programs, answer sets, and the cut rule

inferred← citeshttps://doi.org/10.1007/s00354-007-0028-2openalex-snapshot

Description Logics with Contraries, Contradictories, and Subcontraries

inferred← citeshttps://doi.org/10.1007/s11225-005-8473-8openalex-snapshot

A First Order Nonmonotonic Extension of Constructive Logic

inferred← citeshttps://doi.org/10.1007/s11225-005-8476-5openalex-snapshot

Nelson's Negation on the Base of Weaker Versions of Intuitionistic Negation

inferred← citeshttps://doi.org/10.1007/s11225-006-9004-yopenalex-snapshot

Non-Classical Negation in the Works of Helena Rasiowa and Their Impact on the Theory of Negation

inferred← citeshttps://doi.org/10.1007/s13218-018-0547-7openalex-snapshot

Answer Set Programming from a Logical Point of View

inferred← citeshttps://doi.org/10.1007/s13740-012-0007-8openalex-snapshot

Transaction Logic with Partially Defined Actions

inferred← citeshttps://doi.org/10.1016/b978-044451541-4/50025-7openalex-snapshot

Logically Possible Worlds and Counterpart Semantics for Modal Logic

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

Logic programming with default, weak and strict negations

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

Characterising equilibrium logic and nested logic programs: Reductions and complexity,

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

On Extensions of Intermediate Logics by Strong Negation

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

Logic knowledge bases with two default rules

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

Partiality and Its Dual

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

Some properties of system descriptions of

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

On deductive bases for paraconsistent answer set semantics

inferred← citeshttps://doi.org/10.1093/jigpal/11.6.615openalex-snapshot

Kripke Completeness of First-Order Constructive Logics with Strong Negation

inferred← citeshttps://doi.org/10.1093/logcom/1.6.835openalex-snapshot

Logic Programming with Strong Negation and Inexact Predicates

inferred← citeshttps://doi.org/10.1109/ase.2015.65openalex-snapshot

Fuzzing the Rust Typechecker Using CLP (T)

inferred← citeshttps://doi.org/10.1109/ismvl.1995.513543openalex-snapshot

Three-valued constructive logic and logic programs

inferred← citeshttps://doi.org/10.1109/micai.2010.20openalex-snapshot

Updates Based on ASP

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

Explicit and default negation in databases and logic programs

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

Complexity and expressive power of logic programming

inferred← citeshttps://doi.org/10.12775/llp.1999.009openalex-snapshot

Nelson's paraconsistent logics

inferred← citeshttps://doi.org/10.1305/ndjfl/1040308828openalex-snapshot

Semantics-based Nonmonotonic Inference

inferred← citeshttps://doi.org/10.1609/aimag.v18i3.1304openalex-snapshot

Logic and Databases Past, Present, and Future

inferred← citeshttps://doi.org/10.3233/fi-1994-201236openalex-snapshot

SEMANTICS FOR DISJUNCTIVE LOGIC PROGRAMS WITH EXPLICIT AND DEFAULT NEGATION

inferred← citeshttps://doi.org/10.3233/fun-2006-71403openalex-snapshot

Foundations of Paraconsistent Resolution

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

Defining Rough Sets by Extended Logic Programs

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.