On the public citation graph

A new logical characterisation of stable models and answer sets

https://doi.org/10.1007/bfb0023801
0 signed · 228 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.19690151602openalex-snapshot
A semantical study of constructible falsity
inferredcites →https://doi.org/10.1002/malq.19880340502openalex-snapshot
On the Proof Method for Constructive Falsity
inferredcites →https://doi.org/10.1007/3-540-58025-5_60openalex-snapshot
Answer sets and nonmonotonic S4
inferredcites →https://doi.org/10.1007/3-540-59487-6_27openalex-snapshot
Nonmonotonicity and answer set inference
inferredcites →https://doi.org/10.1007/3-540-61488-5openalex-snapshot
Reasoning with Logic Programming
inferredcites →https://doi.org/10.1007/978-3-322-85796-5openalex-snapshot
Klassische und nichtklassische Aussagenlogik
inferredcites →https://doi.org/10.1007/978-3-662-02906-0openalex-snapshot
Nonmonotonic Logic
inferredcites →https://doi.org/10.1007/978-3-662-02906-0_6openalex-snapshot
Logic programming and nonmonotonic reasoning
inferredcites →https://doi.org/10.1007/978-94-015-6942-2openalex-snapshot
Theory of Logical Calculi
inferredcites →https://doi.org/10.1007/bf01530762openalex-snapshot
Logic programming and reasoning with incomplete information
inferredcites →https://doi.org/10.1007/bf02121114openalex-snapshot
Intuitionistic logic with strong negation
inferredcites →https://doi.org/10.1007/bf03037169openalex-snapshot
Classical negation in logic programs and disjunctive databases
inferredcites →https://doi.org/10.1016/0004-3702(92)90019-topenalex-snapshot
A logic of knowledge and justified assumptions
inferredcites →https://doi.org/10.1016/0004-3702(94)90103-1openalex-snapshot
Minimal belief and negation as failure
inferredcites →https://doi.org/10.1023/a:1004222213212openalex-snapshot
On Extensions of Intermediate Logics by Strong Negation
inferredcites →https://doi.org/10.1305/ndjfl/1093637767openalex-snapshot
Constructive predicate logic with strong negation and model theory.
inferredcites →https://doi.org/10.2307/2274105openalex-snapshot
Constructible falsity and inexact predicates
inferredcites →https://doi.org/10.7551/mitpress/4301.003.0042openalex-snapshot
Declarative and Fixpoint Characterizations of Disjunctive Stable Models
inferredcites →https://doi.org/10.7551/mitpress/4307.003.0011openalex-snapshot
Extended Logic Programs as Autoepistemic Theories
inferredcites →https://doi.org/10.7551/mitpress/4307.003.0012openalex-snapshot
Reflexive Autoepistemic Logic and Logic Programming

What points at this work

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

inferred← citeshttps://doi.org/10.1007/10722086_28openalex-snapshot
A Tableau Calculus for Equilibrium Entailment
inferred← citeshttps://doi.org/10.1007/11546207_10openalex-snapshot
Answer Sets for Propositional Theories
inferred← citeshttps://doi.org/10.1007/11546207_22openalex-snapshot
Nested Epistemic Logic Programs
inferred← citeshttps://doi.org/10.1007/11546207_27openalex-snapshot
Routley Semantics for Answer Sets
inferred← citeshttps://doi.org/10.1007/11546207_7openalex-snapshot
On Modular Translations and Strong Equivalence
inferred← citeshttps://doi.org/10.1007/11595014_2openalex-snapshot
Reducing Propositional Theories in Equilibrium Logic to Logic Programs
inferred← citeshttps://doi.org/10.1007/11799573_26openalex-snapshot
Analysing and Extending Well-Founded and Partial Stable Semantics Using Partial Equilibrium Logic
inferred← citeshttps://doi.org/10.1007/11853886_9openalex-snapshot
On the Logic and Computation of Partial Equilibrium Models
inferred← citeshttps://doi.org/10.1007/11874850_63openalex-snapshot
Strong Negation in Well-Founded and Partial Stable Semantics for Logic Programs
inferred← citeshttps://doi.org/10.1007/3-540-44957-4_46openalex-snapshot
Computing Equilibrium Models Using Signed Formulas
inferred← citeshttps://doi.org/10.1007/3-540-45329-6_31openalex-snapshot
Encodings for Equilibrium Logic and Logic Programs with Nested Expressions
inferred← citeshttps://doi.org/10.1007/3-540-45402-0_6openalex-snapshot
Strong Equivalence for Logic Programs and Default Theories (Made Easy)
inferred← citeshttps://doi.org/10.1007/3-540-45616-3_9openalex-snapshot
Tableau Calculi for the Logics of Finite k-Ary Trees
inferred← citeshttps://doi.org/10.1007/3-540-45619-8_28openalex-snapshot
A Polynomial Translation of Logic Programs with Nested Expressions into Disjunctive Logic Programs: Preliminary Report
inferred← citeshttps://doi.org/10.1007/978-3-030-19570-0_3openalex-snapshot
AGM Meets Abstract Argumentation: Contraction for Dung Frameworks
inferred← citeshttps://doi.org/10.1007/978-3-030-19570-0_40openalex-snapshot
Epistemic Answer Set Programming
inferred← citeshttps://doi.org/10.1007/978-3-030-19570-0_49openalex-snapshot
Axiomatic Systems and Topological Semantics for Intuitionistic Temporal Logic
inferred← citeshttps://doi.org/10.1007/978-3-030-19570-0_51openalex-snapshot
Stable-Ordered Models for Propositional Theories with Order Operators
inferred← citeshttps://doi.org/10.1007/978-3-030-20528-7_11openalex-snapshot
Founded World Views with Autoepistemic Equilibrium Logic
inferred← citeshttps://doi.org/10.1007/978-3-030-22102-7_8openalex-snapshot
Temporal Logic Programs with Temporal Description Logic Axioms
inferred← citeshttps://doi.org/10.1007/978-3-030-24658-7_6openalex-snapshot
Mathematics of Stable Models
inferred← citeshttps://doi.org/10.1007/978-3-030-24658-7_7openalex-snapshot
More About the Language of clingo
inferred← citeshttps://doi.org/10.1007/978-3-030-30244-3_43openalex-snapshot
A Complete Planner for Temporal Answer Set Programming
inferred← citeshttps://doi.org/10.1007/978-3-030-35166-3_8openalex-snapshot
Strongly Equivalent Epistemic Answer Set Programs
inferred← citeshttps://doi.org/10.1007/978-3-030-68446-4_17openalex-snapshot
Synthesis of Modality Definitions and a Theorem Prover for Epistemic Intuitionistic Logic
inferred← citeshttps://doi.org/10.1007/978-3-030-95481-9_5openalex-snapshot
Temporal ASP: From Logical Foundations to Practical Use with telingo
inferred← citeshttps://doi.org/10.1007/978-3-031-01561-8openalex-snapshot
Answer Set Solving in Practice
inferred← citeshttps://doi.org/10.1007/978-3-031-15707-3_1openalex-snapshot
Syntactic ASP Forgetting with Forks
inferred← citeshttps://doi.org/10.1007/978-3-031-15707-3_10openalex-snapshot
Metric Temporal Answer Set Programming over Timed Traces
inferred← citeshttps://doi.org/10.1007/978-3-031-29415-0_5openalex-snapshot
From Felicitous Models to Answer Set Programming
inferred← citeshttps://doi.org/10.1007/978-3-031-35759-6_6openalex-snapshot
Probabilistic Autoepistemic Equilibrium Logic
inferred← citeshttps://doi.org/10.1007/978-3-031-43619-2_34openalex-snapshot
Deontic Equilibrium Logic with eXplicit Negation
inferred← citeshttps://doi.org/10.1007/978-3-031-43619-2_53openalex-snapshot
Past-Present Temporal Programs over Finite Traces
inferred← citeshttps://doi.org/10.1007/978-3-031-74209-5_2openalex-snapshot
Compiling Metric Temporal Answer Set Programming
inferred← citeshttps://doi.org/10.1007/978-3-032-04587-4_17openalex-snapshot
A Kripke Semantics for Intuitionistic Łukasiewicz Logic with Weak Excluded Middle
inferred← citeshttps://doi.org/10.1007/978-3-319-11558-0_24openalex-snapshot
A Free Logic for Stable Models with Partial Intensional Functions
inferred← citeshttps://doi.org/10.1007/978-3-319-14726-0_15openalex-snapshot
Explaining Preferences and Preferring Explanations
inferred← citeshttps://doi.org/10.1007/978-3-319-21542-6_20openalex-snapshot
Binary Frontier-Guarded ASP with Function Symbols
inferred← citeshttps://doi.org/10.1007/978-3-319-23264-5_1openalex-snapshot
Stable Models for Temporal Theories
inferred← citeshttps://doi.org/10.1007/978-3-319-23264-5_18openalex-snapshot
Enablers and Inhibitors in Causal Justifications of Logic Programs
inferred← citeshttps://doi.org/10.1007/978-3-319-23264-5_33openalex-snapshot
Infinitary Equilibrium Logic and Strong Equivalence
inferred← citeshttps://doi.org/10.1007/978-3-319-48758-8_1openalex-snapshot
Metabolic Pathways as Temporal Logic Programs
inferred← citeshttps://doi.org/10.1007/978-3-319-48758-8_11openalex-snapshot
On the Expressiveness of Temporal Equilibrium Logic
inferred← citeshttps://doi.org/10.1007/978-3-319-61660-5_12openalex-snapshot
Gelfond-Zhang Aggregates as Propositional Formulas
inferred← citeshttps://doi.org/10.1007/978-3-319-65340-2_51openalex-snapshot
On the Properties of Atom Definability and Well-Supportedness in Logic Programming
inferred← citeshttps://doi.org/10.1007/978-3-540-24609-1_18openalex-snapshot
Uniform Equivalence for Equilibrium Logic and Logic Programs
inferred← citeshttps://doi.org/10.1007/978-3-540-24609-1_25openalex-snapshot
Strong Equivalence for Causal Theories
inferred← citeshttps://doi.org/10.1007/978-3-540-27775-0_15openalex-snapshot
Simplifying Logic Programs Under Answer Set Semantics
inferred← citeshttps://doi.org/10.1007/978-3-540-30227-8_15openalex-snapshot
Towards a First Order Equilibrium Logic for Nonmonotonic Reasoning
inferred← citeshttps://doi.org/10.1007/978-3-540-30227-8_69openalex-snapshot
tabeql: A Tableau Based Suite for Equilibrium Logic
inferred← citeshttps://doi.org/10.1007/978-3-540-72200-7_17openalex-snapshot
A Characterization of Strong Equivalence for Logic Programs with Variables
inferred← citeshttps://doi.org/10.1007/978-3-540-72200-7_21openalex-snapshot
General Default Logic
inferred← citeshttps://doi.org/10.1007/978-3-540-72982-2_5openalex-snapshot
Quantified Equilibrium Logic and Hybrid Rules
inferred← citeshttps://doi.org/10.1007/978-3-540-75867-9_31openalex-snapshot
Temporal Equilibrium Logic: A First Approach
inferred← citeshttps://doi.org/10.1007/978-3-540-87803-2_3openalex-snapshot
Strongly Equivalent Temporal Logic Programs
inferred← citeshttps://doi.org/10.1007/978-3-540-87803-2_33openalex-snapshot
Meta Level Reasoning and Default Reasoning
inferred← citeshttps://doi.org/10.1007/978-3-540-87803-2_34openalex-snapshot
Rule Calculus: Semantics, Axioms and Applications
inferred← citeshttps://doi.org/10.1007/978-3-540-89982-2_36openalex-snapshot
Partial Functions and Equality in Answer Set Programming
inferred← citeshttps://doi.org/10.1007/978-3-540-89982-2_46openalex-snapshot
Quantified Equilibrium Logic and Foundations for Answer Set Programs
inferred← citeshttps://doi.org/10.1007/978-3-540-89982-2_8openalex-snapshot
Twelve Definitions of a Stable Model
inferred← citeshttps://doi.org/10.1007/978-3-540-89982-2_9openalex-snapshot
Sixty Years of Stable Models
inferred← citeshttps://doi.org/10.1007/978-3-642-02846-5_18openalex-snapshot
Reducts of Propositional Theories, Satisfiability Relations, and Generalizations of Semantics of Logic Programs
inferred← citeshttps://doi.org/10.1007/978-3-642-03351-3_1openalex-snapshot
Well-Founded and Partial Stable Semantics Logical Aspects
inferred← citeshttps://doi.org/10.1007/978-3-642-04238-6_17openalex-snapshot
On Reductive Semantics of Aggregates in Answer Set Programming
inferred← citeshttps://doi.org/10.1007/978-3-642-05082-4_10openalex-snapshot
Answer Sets in a Fuzzy Equilibrium Logic
inferred← citeshttps://doi.org/10.1007/978-3-642-15025-8_24openalex-snapshot
Thirteen Definitions of a Stable Model
inferred← citeshttps://doi.org/10.1007/978-3-642-15675-5_8openalex-snapshot
A Normal Form for Linear Temporal Equilibrium Logic
inferred← citeshttps://doi.org/10.1007/978-3-642-20895-9_16openalex-snapshot
Back and Forth between Rules and SE-Models
inferred← citeshttps://doi.org/10.1007/978-3-642-20895-9_23openalex-snapshot
Contingency-Based Equilibrium Logic
inferred← citeshttps://doi.org/10.1007/978-3-642-20895-9_43openalex-snapshot
STeLP – A Tool for Temporal Answer Set Programming
inferred← citeshttps://doi.org/10.1007/978-3-642-20895-9_9openalex-snapshot
Loop Formulas for Splitable Temporal Logic Programs
inferred← citeshttps://doi.org/10.1007/978-3-642-24206-9_5openalex-snapshot
Datalog Programs and Their Stable Models
inferred← citeshttps://doi.org/10.1007/978-3-642-24364-6_10openalex-snapshot
The Modal Logic of Equilibrium Models
inferred← citeshttps://doi.org/10.1007/978-3-642-30743-0_1openalex-snapshot
To Vladimir Lifschitz on His 65th Birthday
inferred← citeshttps://doi.org/10.1007/978-3-642-30743-0_11openalex-snapshot
Strong Equivalence of RASP Programs
inferred← citeshttps://doi.org/10.1007/978-3-642-30743-0_13openalex-snapshot
Approximation Fixpoint Theory and the Semantics of Logic and Answers Set Programs
inferred← citeshttps://doi.org/10.1007/978-3-642-30743-0_18openalex-snapshot
Bi-state Logic
inferred← citeshttps://doi.org/10.1007/978-3-642-30743-0_37openalex-snapshot
Connecting First-Order ASP and the Logic FO(ID) through Reducts
inferred← citeshttps://doi.org/10.1007/978-3-642-30743-0_7openalex-snapshot
Here and There among Logics for Logic Programming
inferred← citeshttps://doi.org/10.1007/978-3-642-32211-2_5openalex-snapshot
Automata-Based Computation of Temporal Equilibrium Models
inferred← citeshttps://doi.org/10.1007/978-3-642-34922-5_15openalex-snapshot
Fuzzy Answer Set Programming: An Introduction
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_38openalex-snapshot
On Equivalent Transformations of Infinitary Formulas under the Stable Model Semantics
inferred← citeshttps://doi.org/10.1007/bfb0054795openalex-snapshot
Reasoning with prioritized defaults
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/s10115-010-0294-zopenalex-snapshot
A semantical framework for hybrid knowledge bases
inferred← citeshttps://doi.org/10.1007/s10472-006-9025-2openalex-snapshot
A generalization of the Lin-Zhao theorem
inferred← citeshttps://doi.org/10.1007/s10472-006-9028-zopenalex-snapshot
Equilibrium logic
inferred← citeshttps://doi.org/10.1007/s10472-009-9161-6openalex-snapshot
General default logic
inferred← citeshttps://doi.org/10.1007/s10472-018-9615-9openalex-snapshot
Equilibrium graphs
inferred← citeshttps://doi.org/10.1007/s10472-019-09632-yopenalex-snapshot
Digital forensics and investigations meet artificial intelligence
inferred← citeshttps://doi.org/10.1007/s10472-019-09633-xopenalex-snapshot
A multiparametric view on answer set programming
inferred← citeshttps://doi.org/10.1007/s10472-025-09999-1openalex-snapshot
A prudent logic of partial functions
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-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/s11225-022-10003-8openalex-snapshot
A Proof-Theoretic Approach to Negative Translations in Intuitionistic Tense Logics
inferred← citeshttps://doi.org/10.1007/s11787-025-00402-5openalex-snapshot
Splitting Property for Epistemic Equilibrium Logics
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.1016/j.artint.2010.04.001openalex-snapshot
From answer set logic programming to circumscription via logic of GK
inferred← citeshttps://doi.org/10.1016/j.artint.2010.04.004openalex-snapshot
Formalising the Fisherman's Folly puzzle
inferred← citeshttps://doi.org/10.1016/j.artint.2010.04.011openalex-snapshot
Stable models and circumscription
inferred← citeshttps://doi.org/10.1016/j.artint.2010.08.004openalex-snapshot
Reducts of propositional theories, satisfiability relations, and generalizations of semantics of logic programs
inferred← citeshttps://doi.org/10.1016/j.artint.2011.11.001openalex-snapshot
Ordered completion for first-order logic programs on finite structures
inferred← citeshttps://doi.org/10.1016/j.artint.2012.04.001openalex-snapshot
Conflict-driven answer set solving: From theory to practice
inferred← citeshttps://doi.org/10.1016/j.artint.2014.05.001openalex-snapshot
FLP answer set semantics without circular justifications for general logic programs
inferred← citeshttps://doi.org/10.1016/j.artint.2016.04.004openalex-snapshot
Evaluating epistemic negation in answer set programming
inferred← citeshttps://doi.org/10.1016/j.artint.2017.02.002openalex-snapshot
Infinitary equilibrium logic and strongly equivalent logic programs
inferred← citeshttps://doi.org/10.1016/j.artint.2018.10.007openalex-snapshot
Gelfond–Zhang aggregates as propositional formulas
inferred← citeshttps://doi.org/10.1016/j.artint.2019.04.004openalex-snapshot
Vicious circle principle, aggregates, and formation of sets in ASP based languages
inferred← citeshttps://doi.org/10.1016/j.artint.2019.07.005openalex-snapshot
Forgetting auxiliary atoms in forks
inferred← citeshttps://doi.org/10.1016/j.artint.2019.103165openalex-snapshot
Determining inference semantics for disjunctive logic programs
inferred← citeshttps://doi.org/10.1016/j.artint.2020.103249openalex-snapshot
Autoepistemic equilibrium logic and epistemic specifications
inferred← citeshttps://doi.org/10.1016/j.artint.2020.103382openalex-snapshot
Autoepistemic answer set programming
inferred← citeshttps://doi.org/10.1016/j.artint.2024.104236openalex-snapshot
Gödel–Dummett linear temporal logic
inferred← citeshttps://doi.org/10.1016/j.entcs.2020.10.004openalex-snapshot
Towards an Answer Set Programming Methodology for Constructing Programs Following a Semi-Automatic Approach – Extended and Revised version
inferred← citeshttps://doi.org/10.1016/j.entcs.2020.10.011openalex-snapshot
An Extension of the Stable Semantics via Lukasiewicz Logic
inferred← citeshttps://doi.org/10.1016/j.ipl.2009.02.002openalex-snapshot
Strong equivalence of logic programs under the infinite-valued semantics
inferred← citeshttps://doi.org/10.1016/j.jal.2013.12.003openalex-snapshot
Capturing equilibrium models in modal logic
inferred← citeshttps://doi.org/10.1016/s0004-3702(02)00207-2openalex-snapshot
Logic programming and knowledge representation—The A-Prolog perspective
inferred← citeshttps://doi.org/10.1016/s0743-1066(97)10005-xopenalex-snapshot
A logical foundation for logic programming I: Biconsequence relations and nonmonotonic completion
inferred← citeshttps://doi.org/10.1016/s0743-1066(98)10015-8openalex-snapshot
Stable inference as intuitionistic validity
inferred← citeshttps://doi.org/10.1016/s1574-6526(07)03007-6openalex-snapshot
Chapter 7 Answer Sets
inferred← citeshttps://doi.org/10.1017/s147106840200159xopenalex-snapshot
Characterization of strongly equivalent logic programs in intermediate logics
inferred← citeshttps://doi.org/10.1017/s1471068403001923openalex-snapshot
Weight constraints as nested expressions
inferred← citeshttps://doi.org/10.1017/s1471068404002212openalex-snapshot
A uniform approach to logic programming semantics
inferred← citeshttps://doi.org/10.1017/s1471068407003110openalex-snapshot
Propositional theories are strongly equivalent to logic programs
inferred← citeshttps://doi.org/10.1017/s147106840999010xopenalex-snapshot
Characterising equilibrium logic and nested logic programs: Reductions and complexity,
inferred← citeshttps://doi.org/10.1017/s1471068410000517openalex-snapshot
Functional answer set programming
inferred← citeshttps://doi.org/10.1017/s1471068413000100openalex-snapshot
The rise and fall of semantic rule updates based onSE-models
inferred← citeshttps://doi.org/10.1017/s147106841300063xopenalex-snapshot
Characterizing and extending answer set semantics using possibility theory
inferred← citeshttps://doi.org/10.1017/s1471068414000088openalex-snapshot
On equivalence of infinitary formulas under the stable model semantics
inferred← citeshttps://doi.org/10.1017/s1471068414000313openalex-snapshot
Minimum Model Semantics for Extensional Higher-order Logic Programming with Negation
inferred← citeshttps://doi.org/10.1017/s1471068415000277openalex-snapshot
A denotational semantics for equilibrium logic
inferred← citeshttps://doi.org/10.1017/s1471068420000058openalex-snapshot
Splitting Epistemic Logic Programs
inferred← citeshttps://doi.org/10.1017/s1471068421000235openalex-snapshot
A Logical Characterization of the Preferred Models of Logic Programs with Ordered Disjunction
inferred← citeshttps://doi.org/10.1017/s1471068421000508openalex-snapshot
How to Build Your Own ASP-based System?!
inferred← citeshttps://doi.org/10.1017/s1471068421000557openalex-snapshot
Linear-Time Temporal Answer Set Programming
inferred← citeshttps://doi.org/10.1017/s1471068422000060openalex-snapshot
A Brief History of Updates of Answer-Set Programs
inferred← citeshttps://doi.org/10.1017/s1471068422000242openalex-snapshot
Strong Equivalence of Logic Programs with Ordered Disjunction: A Logical Perspective
inferred← citeshttps://doi.org/10.1017/s1471068422000254openalex-snapshot
Abductive Reasoning in Intuitionistic Propositional Logic via Theorem Synthesis
inferred← citeshttps://doi.org/10.1017/s1471068423000315openalex-snapshot
The Stable Model Semantics of Datalog with Metric Temporal Operators
inferred← citeshttps://doi.org/10.1017/s1471068425100379openalex-snapshot
Deductive Systems for Logic Programs with Counting
inferred← citeshttps://doi.org/10.1017/s147106842610043xopenalex-snapshot
Applications of Intuitionistic Temporal Logic to Temporal Answer Set Programming
inferred← citeshttps://doi.org/10.1017/s1471068426100519openalex-snapshot
flingo – Instilling ASP Expressiveness into Linear Integer Constraints
inferred← citeshttps://doi.org/10.1017/s147106842610057xopenalex-snapshot
Equilibrium Semantics and Strong Equivalence for Higher-Order Logic Programs
inferred← citeshttps://doi.org/10.1017/s1471068426100581openalex-snapshot
Reducing Arbitrary Metric Temporal Formulas into Logic Programs Under Answer Set Semantics
inferred← citeshttps://doi.org/10.1017/s1471068426100714openalex-snapshot
Implementing Metric Temporal Answer Set Programming
inferred← citeshttps://doi.org/10.1023/a:1004222213212openalex-snapshot
On Extensions of Intermediate Logics by Strong Negation
inferred← citeshttps://doi.org/10.1023/a:1018978005636openalex-snapshot
Nested expressions in logic programs
inferred← citeshttps://doi.org/10.1057/9781137030894_4openalex-snapshot
Sixty Years of Stable Models
inferred← citeshttps://doi.org/10.1080/11663081.2013.798959openalex-snapshot
The infinite-valued semantics: overview, recent results and future directions
inferred← citeshttps://doi.org/10.1080/11663081.2013.798971openalex-snapshot
On deductive bases for paraconsistent answer set semantics
inferred← citeshttps://doi.org/10.1080/11663081.2013.798985openalex-snapshot
Temporal equilibrium logic: a survey
inferred← citeshttps://doi.org/10.1080/11663081.2013.798997openalex-snapshot
RASP and ASP as a fragment of linear logic
inferred← citeshttps://doi.org/10.1080/11663081.2013.799318openalex-snapshot
Model-based recasting in answer-set programming
inferred← citeshttps://doi.org/10.1080/11663081.2018.1427987openalex-snapshot
Temporal Equilibrium Logic with past operators
inferred← citeshttps://doi.org/10.1080/11663081.2018.1439358openalex-snapshot
Stable reasoning
inferred← citeshttps://doi.org/10.1080/11663081.2023.2244362openalex-snapshot
Logical connectives for two-state semantics
inferred← citeshttps://doi.org/10.1080/11663081.2023.2244365openalex-snapshot
Metric dynamic equilibrium logic
inferred← citeshttps://doi.org/10.1080/13875868.2015.1091837openalex-snapshot
Framing holes within a loop hierarchy
inferred← citeshttps://doi.org/10.1093/jigpal/jzw060openalex-snapshot
Verification for ASP denotational semantics: a case study using the PVS theorem prover
inferred← citeshttps://doi.org/10.1093/logcom/exz010openalex-snapshot
A bilateral Hilbert-style investigation of 2-intuitionistic logic
inferred← citeshttps://doi.org/10.1109/ictai62512.2024.00062openalex-snapshot
Introducing Constraint Well-Founded Semantics for Constraint Logic Programming Through Rewriting Transformations
inferred← citeshttps://doi.org/10.1109/ismvl.2007.33openalex-snapshot
Model-Characterizing Formulas and Normal Forms in Godel Logics
inferred← citeshttps://doi.org/10.1109/lics.2015.65openalex-snapshot
On the Complexity of Temporal Equilibrium Logic
inferred← citeshttps://doi.org/10.1145/2362355.2362361openalex-snapshot
Fuzzy Equilibrium Logic
inferred← citeshttps://doi.org/10.1145/2480759.2480767openalex-snapshot
Tableau Calculi for Logic Programs under Answer Set Semantics
inferred← citeshttps://doi.org/10.1145/3191315.3191318openalex-snapshot
An introduction to the stable and well-founded semantics of logic programs
inferred← citeshttps://doi.org/10.1145/383779.383783openalex-snapshot
Strongly equivalent logic programs
inferred← citeshttps://doi.org/10.13140/rg.2.1.2941.9363openalex-snapshot
Characterising Access Control Conflicts
inferred← citeshttps://doi.org/10.1609/aaai.v38i9.28917openalex-snapshot
Stable Model Semantics for Description Logic Terminologies
inferred← citeshttps://doi.org/10.1613/jair.3991openalex-snapshot
Strong Equivalence of Qualitative Optimization Problems
inferred← citeshttps://doi.org/10.21146/2074-1472-2021-27-1-64-81openalex-snapshot
Default Negation as Explicit Negation plus Update
inferred← citeshttps://doi.org/10.2200/s00457ed1v01y201211aim019openalex-snapshot
Answer Set Solving in Practice
inferred← citeshttps://doi.org/10.24963/ijcai.2019/232openalex-snapshot
An ASP Approach to Generate Minimal Countermodels in Intuitionistic Propositional Logic
inferred← citeshttps://doi.org/10.24963/ijcai.2020/249openalex-snapshot
On the Decidability of Intuitionistic Tense Logic without Disjunction
inferred← citeshttps://doi.org/10.24963/ijcai.2020/696openalex-snapshot
Forgetting Auxiliary Atoms in Forks (Extended Abstract)
inferred← citeshttps://doi.org/10.24963/kr.2021/58openalex-snapshot
DatalogMTL with Negation Under Stable Models Semantics
inferred← citeshttps://doi.org/10.25932/publishup-46969openalex-snapshot
Revisiting explicit negation in answer set programming
inferred← citeshttps://doi.org/10.29007/sclqopenalex-snapshot
Epistemic Logic Programs with World View Constraints
inferred← citeshttps://doi.org/10.31414/ee.2019.d.130739openalex-snapshot
Prova de correção do algoritmo oASP (MDP) utilizando representação diagramática
inferred← citeshttps://doi.org/10.3166/ria.26.85-102openalex-snapshot
La logique modale des modèles d’équilibre
inferred← citeshttps://doi.org/10.3233/aac-210028openalex-snapshot
Argumentation frameworks with necessities and their relationship with logic programs
inferred← citeshttps://doi.org/10.3233/aic-2011-0494openalex-snapshot
A logical characterisation of ordered disjunction
inferred← citeshttps://doi.org/10.3233/faia200140openalex-snapshot
Explicit Negation in Linear-Dynamic Equilibrium Logic
inferred← citeshttps://doi.org/10.3233/fi-2016-1399openalex-snapshot
Towards Deriving Conclusions from Cause-effect Relations
inferred← citeshttps://doi.org/10.3390/a15060201openalex-snapshot
Comparing the Reasoning Capabilities of Equilibrium Theories and Answer Set Programs
inferred← citeshttps://doi.org/10.4204/eptcs.345.15openalex-snapshot
Proceedings 37th International Conference on Logic Programming (Technical Communications)
inferred← citeshttps://doi.org/10.4204/eptcs.345.42openalex-snapshot
Automata Techniques for Temporal Answer Set Programming
inferred← citeshttps://doi.org/10.4204/eptcs.416.38openalex-snapshot
Hybrid Answer Set Programming: Foundations and Applications
inferred← citeshttps://doi.org/10.4230/lipics.iclp.2011.274openalex-snapshot
Promoting Modular Nonmonotonic Logic Programs
inferred← citeshttps://doi.org/10.4230/lipics.iclp.2012.290openalex-snapshot
Paving the Way for Temporal Grounding
inferred← citeshttps://doi.org/10.4230/lipics.iclp.2012.445openalex-snapshot
Temporal Answer Set Programming
inferred← citeshttps://doi.org/10.48550/arxiv.1012.3947openalex-snapshot
Interpolation in Equilibrium Logic and Answer Set Programming: the Propositional Case
inferred← citeshttps://doi.org/10.48550/arxiv.1102.5385openalex-snapshot
Back and Forth Between Rules and SE-Models (Extended Version)
inferred← citeshttps://doi.org/10.48550/arxiv.1211.2986openalex-snapshot
A Strongly Grounded Stable Model Semantics for Full Propositional Language
inferred← citeshttps://doi.org/10.48550/arxiv.1401.3897openalex-snapshot
Interpolable Formulas in Equilibrium Logic and Answer Set Programming
inferred← citeshttps://doi.org/10.48550/arxiv.1503.00043openalex-snapshot
On the complexity of Temporal Equilibrium Logic
inferred← citeshttps://doi.org/10.48550/arxiv.1510.05326openalex-snapshot
Combining intermediate propositional logics with classical logic
inferred← citeshttps://doi.org/10.48550/arxiv.1901.09125openalex-snapshot
The informal semantics of Answer Set Programming: A Tarskian perspective
showing the first 200 of 208 · page through all 208
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.