On the public citation graph

Stable semantics for disjunctive programs

https://doi.org/10.1007/bf03037171
0 signed · 279 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.1007/3-540-50701-9_20openalex-snapshot
Autoepistemic stable closures and contradiction resolution
inferredcites →https://doi.org/10.1007/3-540-55015-1_5openalex-snapshot
Semantics of disjunctive logic programs and deductive databases
inferredcites →https://doi.org/10.1007/bfb0000066openalex-snapshot
On indefinite databases and the closed world assumption
inferredcites →https://doi.org/10.1016/0004-3702(85)90042-6openalex-snapshot
Semantical considerations on nonmonotonic logic
inferredcites →https://doi.org/10.1016/0004-3702(89)90068-4openalex-snapshot
On the relationship between circumscription and negation as failure
inferredcites →https://doi.org/10.1016/0004-3702(90)90057-7openalex-snapshot
A skeptical theory of inheritance in nonmonotonic semantic networks
inferredcites →https://doi.org/10.1016/0004-3702(91)90011-8openalex-snapshot
Hard problems for simple default logics
inferredcites →https://doi.org/10.1016/0004-3702(91)90013-aopenalex-snapshot
Three-valued nonmonotonic formalisms and semantics of logic programs
inferredcites →https://doi.org/10.1016/0743-1066(87)90007-0openalex-snapshot
Negation in logic programming
inferredcites →https://doi.org/10.1016/0743-1066(89)90032-0openalex-snapshot
Negation as Failure Using Tight Derivations for General Logic Programs
inferredcites →https://doi.org/10.1016/0890-5401(91)90073-bopenalex-snapshot
General logical databases and programs: Default logic semantics and stratification
inferredcites →https://doi.org/10.1016/b978-0-444-88433-6.50029-0openalex-snapshot
The Well Founded Semantics for Disjunctive Logic Programs
inferredcites →https://doi.org/10.1016/b978-0-934613-40-8.50006-3openalex-snapshot
Towards a Theory of Declarative Knowledge
inferredcites →https://doi.org/10.1016/b978-0-934613-40-8.50009-9openalex-snapshot
On the Declarative Semantics of Deductive Databases and Logic Programs
inferredcites →https://doi.org/10.1016/s0743-1066(85)80005-4openalex-snapshot
A kripke-kleene semantics for logic programs*
inferredcites →https://doi.org/10.1145/116825.116836openalex-snapshot
Autoepistemic logic
inferredcites →https://doi.org/10.1145/116825.116838openalex-snapshot
The well-founded semantics for general logic programs
inferredcites →https://doi.org/10.1145/308386.308444openalex-snapshot
Unfounded sets and well-founded semantics for general logic programs
inferredcites →https://doi.org/10.1145/321978.321991openalex-snapshot
The Semantics of Predicate Logic as a Programming Language
inferredcites →https://doi.org/10.1145/6012.15409openalex-snapshot
Positivism vs minimalism in deductive databases
inferredcites →https://doi.org/10.1145/73721.73722openalex-snapshot
The alternating fixpoint of logic programs with negation
inferredcites →https://doi.org/10.1145/73721.73723openalex-snapshot
Every logic program has a natural stratification and an iterated least fixed point model
inferredcites →https://doi.org/10.1145/73721.73724openalex-snapshot
A procedural semantics for well founded negation in logic programs
inferredcites →https://doi.org/10.1145/73721.73725openalex-snapshot
Logic programming as constructivism: a formalization and its application to databases
inferredcites →https://doi.org/10.3233/fi-1990-13404openalex-snapshot
Well-Founded Semantics Coincides with Three-Valued Stable Semantics1

What points at this work

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

inferred← citeshttps://doi.org/10.1002/9780470050118.ecse226openalex-snapshot
Answer Set Programming
inferred← citeshttps://doi.org/10.1006/inco.1997.2630openalex-snapshot
Disjunctive Stable Models: Unfounded Sets, Fixpoint Semantics, and Computation
inferred← citeshttps://doi.org/10.1007/10722086_28openalex-snapshot
A Tableau Calculus for Equilibrium Entailment
inferred← citeshttps://doi.org/10.1007/11425274_43openalex-snapshot
Aggregates and Preferences in Logic Programming
inferred← citeshttps://doi.org/10.1007/11546207_36openalex-snapshot
circ2dlp — Translating Circumscription into Disjunctive Logic Programming
inferred← citeshttps://doi.org/10.1007/11562931_26openalex-snapshot
A Well-Founded Semantics with Disjunction
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_37openalex-snapshot
Representing Causal Information About a Probabilistic Process
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-36078-6_15openalex-snapshot
Query Optimization of Disjunctive Databases with Constraints through Binding Propagation
inferred← citeshttps://doi.org/10.1007/3-540-44957-4_10openalex-snapshot
Partial Models of Extended Generalized Logic Programs
inferred← citeshttps://doi.org/10.1007/3-540-45402-0_21openalex-snapshot
Improving ASP Instantiators by Join-Ordering Methods
inferred← citeshttps://doi.org/10.1007/3-540-45402-0_25openalex-snapshot
Fixpoint Characterizations for Many-Valued Disjunctive Logic Programs with Probabilistic Semantics
inferred← citeshttps://doi.org/10.1007/3-540-45402-0_7openalex-snapshot
On the Effect of Default Negation on the Expressiveness of Disjunctive Rules
inferred← citeshttps://doi.org/10.1007/3-540-45402-0_9openalex-snapshot
On the Relationship between Defeasible Logic and Well-Founded Semantics
inferred← citeshttps://doi.org/10.1007/3-540-45616-3_8openalex-snapshot
Modal Nonmonotonic Logics Revisited: Efficient Encodings for the Basic Reasoning Tasks
inferred← citeshttps://doi.org/10.1007/3-540-45628-7_18openalex-snapshot
Disjunctive Logic Programming: A Survey and Assessment
inferred← citeshttps://doi.org/10.1007/3-540-45632-5_16openalex-snapshot
Representing Knowledge in A-Prolog
inferred← citeshttps://doi.org/10.1007/3-540-45757-7_20openalex-snapshot
Interpolation Theorems for Nonmonotonic Reasoning Systems
inferred← citeshttps://doi.org/10.1007/3-540-45757-7_36openalex-snapshot
Preferred Answer Sets for Ordered Logic Programs
inferred← citeshttps://doi.org/10.1007/3-540-46564-2_15openalex-snapshot
Clausal Deductive Databases and a General Framework for Semantics in Disjunctive Deductive Databases
inferred← citeshttps://doi.org/10.1007/3-540-46767-x_16openalex-snapshot
Minimal Founded Semantics for Disjunctive Logic Programming
inferred← citeshttps://doi.org/10.1007/3-540-46767-x_20openalex-snapshot
Many-Valued Disjunctive Logic Programs with Probabilistic Semantics
inferred← citeshttps://doi.org/10.1007/3-540-48317-9_2openalex-snapshot
Logic-Based Knowledge Representation
inferred← citeshttps://doi.org/10.1007/3-540-55015-1_5openalex-snapshot
Semantics of disjunctive logic programs and deductive databases
inferred← citeshttps://doi.org/10.1007/3-540-55808-x_44openalex-snapshot
Two simple characterizations of well-founded semantics
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-57287-2_48openalex-snapshot
Well-founded approximations of autoepistemic logic
inferred← citeshttps://doi.org/10.1007/3-540-57802-1_5openalex-snapshot
Expressive power and complexity of disjunctive datalog under the stable model semantics
inferred← citeshttps://doi.org/10.1007/3-540-58792-6_11openalex-snapshot
Partial deduction of disjunctive logic programs: A declarative approach
inferred← citeshttps://doi.org/10.1007/3-540-58907-4_7openalex-snapshot
Querying disjunctive databases through nonmonotonic logics
inferred← citeshttps://doi.org/10.1007/3-540-59487-6_1openalex-snapshot
Complexity results for abductive logic programming
inferred← citeshttps://doi.org/10.1007/3-540-59487-6_10openalex-snapshot
Loop checking and the well-founded semantics
inferred← citeshttps://doi.org/10.1007/3-540-59487-6_12openalex-snapshot
Update by means of inference rules
inferred← citeshttps://doi.org/10.1007/3-540-59487-6_25openalex-snapshot
Embedding circumscriptive theories in general disjunctive programs
inferred← citeshttps://doi.org/10.1007/3-540-59487-6_26openalex-snapshot
Stable classes and operator pairs for disjunctive programs
inferred← citeshttps://doi.org/10.1007/3-540-59487-6_7openalex-snapshot
Characterizations of the stable semantics by partial evaluation
inferred← citeshttps://doi.org/10.1007/3-540-60428-6_4openalex-snapshot
Belief revision in non-monotonic reasoning
inferred← citeshttps://doi.org/10.1007/3-540-61630-6_10openalex-snapshot
Strong and explicit negation in non-monotonic reasoning and logic programming
inferred← citeshttps://doi.org/10.1007/3-540-61630-6_19openalex-snapshot
Characterizing D-WFS: Confluence and iterated GCWA
inferred← citeshttps://doi.org/10.1007/3-540-63255-7_27openalex-snapshot
A deductive system for non-monotonic reasoning
inferred← citeshttps://doi.org/10.1007/978-1-4615-1567-8_4openalex-snapshot
Declarative Problem-Solving Using the DLV System
inferred← citeshttps://doi.org/10.1007/978-1-4615-5643-5_10openalex-snapshot
Logical Approaches to Incomplete Information: A Survey
inferred← citeshttps://doi.org/10.1007/978-3-030-60067-9_6openalex-snapshot
An Introduction to Answer Set Programming and Some of Its Extensions
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-030-86772-0_13openalex-snapshot
Assumption-Based Argumentation Is Logic Programming with Projection
inferred← citeshttps://doi.org/10.1007/978-3-030-87334-9_10openalex-snapshot
Many-Valued Dynamic Object-Oriented Inheritance and Approximations
inferred← citeshttps://doi.org/10.1007/978-3-031-01854-1openalex-snapshot
Datalog and Logic Databases
inferred← citeshttps://doi.org/10.1007/978-3-031-11321-5_3openalex-snapshot
Assumption-Based Argumentation for Extended Disjunctive Logic Programming
inferred← citeshttps://doi.org/10.1007/978-3-031-15707-3_25openalex-snapshot
Interlinking Logic Programs and Argumentation Frameworks
inferred← citeshttps://doi.org/10.1007/978-3-031-27181-6_34openalex-snapshot
Adventures with Datalog: Walking the Thin Line Between Theory and Practice
inferred← citeshttps://doi.org/10.1007/978-3-319-11558-0_32openalex-snapshot
Modular Paracoherent Answer Sets
inferred← citeshttps://doi.org/10.1007/978-3-319-14726-0_16openalex-snapshot
Preference-Based Diagnosis Selection in Multi-Context Systems
inferred← citeshttps://doi.org/10.1007/978-3-319-14726-0_9openalex-snapshot
Stability, Supportedness, Minimality and Kleene Answer Set Programs
inferred← citeshttps://doi.org/10.1007/978-3-319-23264-5_39openalex-snapshot
Characterising and Explaining Inconsistency in Logic Programs
inferred← citeshttps://doi.org/10.1007/978-3-319-44832-9_3openalex-snapshot
Argumentation-Based Semantics for Logic Programs with First-Order Formulae
inferred← citeshttps://doi.org/10.1007/978-3-319-49130-1_17openalex-snapshot
Boosting the Development of ASP-Based Applications in Mobile and General Scenarios
inferred← citeshttps://doi.org/10.1007/978-3-319-49397-8_3openalex-snapshot
An Entailment Procedure for Kleene Answer Set Programs
inferred← citeshttps://doi.org/10.1007/978-3-540-24599-5_12openalex-snapshot
Efficient Evaluation of Logic Programs for Querying Data Integration Systems
inferred← citeshttps://doi.org/10.1007/978-3-540-24599-5_14openalex-snapshot
Order and Negation as Failure
inferred← citeshttps://doi.org/10.1007/978-3-540-24599-5_16openalex-snapshot
Uniform Equivalence of Logic Programs under the Stable Model Semantics
inferred← citeshttps://doi.org/10.1007/978-3-540-24609-1_10openalex-snapshot
Simplifying Logic Programs Under Uniform and Strong Equivalence
inferred← citeshttps://doi.org/10.1007/978-3-540-24609-1_11openalex-snapshot
Towards Automated Integration of Guess and Check Programs in Answer Set Programming
inferred← citeshttps://doi.org/10.1007/978-3-540-30227-8_14openalex-snapshot
Capturing Parallel Circumscription with Disjunctive Logic Programs
inferred← citeshttps://doi.org/10.1007/978-3-540-30227-8_16openalex-snapshot
Characterizations for Relativized Notions of Equivalence in Answer Set Programming
inferred← citeshttps://doi.org/10.1007/978-3-540-39615-4_7openalex-snapshot
Model and Fixpoint Semantics for Fuzzy Disjunctive Programs with Weak Similarity
inferred← citeshttps://doi.org/10.1007/978-3-540-72982-2_24openalex-snapshot
AceRules: Executing Rules in Controlled Natural Language
inferred← citeshttps://doi.org/10.1007/978-3-540-74610-2_3openalex-snapshot
Answer Set Programming for the Semantic Web
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-75185-4_21openalex-snapshot
A Fixpoint Approach to State Generation for Stratifiable Disjunctive Deductive Databases
inferred← citeshttps://doi.org/10.1007/978-3-540-85776-1_15openalex-snapshot
Implementing Prioritized Circumscription by Computing Disjunctive Stable Models
inferred← citeshttps://doi.org/10.1007/978-3-540-87803-2_8openalex-snapshot
Normal Form Nested Programs
inferred← citeshttps://doi.org/10.1007/978-3-540-89704-0_8openalex-snapshot
Versatile Semantic Modeling of Frame Logic Programs under Answer Set Semantics
inferred← citeshttps://doi.org/10.1007/978-3-540-89982-2_10openalex-snapshot
The DLV Project: A Tour from Theory and Research to Applications and Market
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-14309-0_8openalex-snapshot
Answer Set Programming
inferred← citeshttps://doi.org/10.1007/978-3-642-23032-5_6openalex-snapshot
Rules and Logic Programming for the Web
inferred← citeshttps://doi.org/10.1007/978-3-642-31467-4_11openalex-snapshot
Comparing Inconsistency Resolutions in Multi-Context Systems
inferred← citeshttps://doi.org/10.1007/978-3-642-39091-3_9openalex-snapshot
On the Equivalence between Logic Programming Semantics and Argumentation Semantics
inferred← citeshttps://doi.org/10.1007/978-3-642-39784-4_4openalex-snapshot
Answer Set Programming
inferred← citeshttps://doi.org/10.1007/978-3-642-40885-4_8openalex-snapshot
Abduction in Logic Programming as Second-Order Quantifier Elimination
inferred← citeshttps://doi.org/10.1007/978-3-642-51136-3_10openalex-snapshot
Disjunctive Logic Programming over Finite Structures
inferred← citeshttps://doi.org/10.1007/978-3-642-51136-3_9openalex-snapshot
From above and from below: Approximating stable models
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-3-7908-1782-9_21openalex-snapshot
Semantics for Fuzzy Disjunctive Programs with Weak Similarity
inferred← citeshttps://doi.org/10.1007/978-94-017-1652-9_24openalex-snapshot
Logic Programs with Context-Dependent Preferences
inferred← citeshttps://doi.org/10.1007/978-981-92-0184-6_9openalex-snapshot
Computing Supported Models via Transformation to Stable Models: A System Description
inferred← citeshttps://doi.org/10.1007/bf00881915openalex-snapshot
An alternative approach to the semantics of disjunctive logic programs and deductive databases
inferred← citeshttps://doi.org/10.1007/bf01530759openalex-snapshot
Overview of disjunctive logic programming
inferred← citeshttps://doi.org/10.1007/bf01530784openalex-snapshot
Well-founded and stationary models of logic programs
inferred← citeshttps://doi.org/10.1007/bf01530802openalex-snapshot
Disjunctive LP+integrity constraints= stable model semantics
inferred← citeshttps://doi.org/10.1007/bf01530826openalex-snapshot
Static semantics for normal and disjunctive logic programs
inferred← citeshttps://doi.org/10.1007/bf01536399openalex-snapshot
On the computational cost of disjunctive logic programming: Propositional case
inferred← citeshttps://doi.org/10.1007/bf02916589openalex-snapshot
Disjunctive logic and semantics of disjunctive logic programs
inferred← citeshttps://doi.org/10.1007/bf02916841openalex-snapshot
Consistency-based abduction with extended disjunctive logic programs
inferred← citeshttps://doi.org/10.1007/bf02919444openalex-snapshot
Credulous argumentation with the disjunctive stable semantics
inferred← citeshttps://doi.org/10.1007/bf02948986openalex-snapshot
Closed world assumption for disjunctive reasoning
inferred← citeshttps://doi.org/10.1007/bfb0013073openalex-snapshot
Disjunctive deductive databases
inferred← citeshttps://doi.org/10.1007/bfb0023799openalex-snapshot
Prolegomena to logic programming for non-monotonic reasoning
inferred← citeshttps://doi.org/10.1007/bfb0023800openalex-snapshot
On logics and semantics for general logic programs
inferred← citeshttps://doi.org/10.1007/bfb0030659openalex-snapshot
Samantics of normal and disjunctive logic programs a unifying framework
inferred← citeshttps://doi.org/10.1007/bfb0030663openalex-snapshot
A general approach to bottom-up computation of disjunctive semantics
inferred← citeshttps://doi.org/10.1007/bfb0030666openalex-snapshot
Computing stable and partial stable models of extended disjunctive logic programs
inferred← citeshttps://doi.org/10.1007/bfb0031734openalex-snapshot
Logic and databases: A 20 year retrospective
inferred← citeshttps://doi.org/10.1007/bfb0031745openalex-snapshot
The expressive power of partial models for disjunctive deductive databases
inferred← citeshttps://doi.org/10.1007/bfb0031746openalex-snapshot
Stable model checking for disjunctive logic programs
inferred← citeshttps://doi.org/10.1007/bfb0034711openalex-snapshot
Partial semantics for disjunctive deductive databases
inferred← citeshttps://doi.org/10.1007/bfb0034719openalex-snapshot
On the computation of disjunctive stable models
inferred← citeshttps://doi.org/10.1007/bfb0049128openalex-snapshot
Disjunctive ordered logic
inferred← citeshttps://doi.org/10.1007/bfb0054789openalex-snapshot
Datalog with nested rules
inferred← citeshttps://doi.org/10.1007/bfb0054790openalex-snapshot
Partial evidential stable models for disjunctive deductive databases
inferred← citeshttps://doi.org/10.1007/bfb0054791openalex-snapshot
Disjunctive logic programming and autoepistemic logic
inferred← citeshttps://doi.org/10.1007/bfb0054794openalex-snapshot
Abduction, argumentation and bi-disjunctive logic programs
inferred← citeshttps://doi.org/10.1007/bfb0055020openalex-snapshot
Disjunctive logic programming and possible model semantics
inferred← citeshttps://doi.org/10.1007/bfb0056015openalex-snapshot
An alternating well-founded semantics for query answering in disjunctive databases
inferred← citeshttps://doi.org/10.1007/s00354-018-0046-2openalex-snapshot
Fostering the Use of Declarative Formalisms for Real-World Applications: The EmbASP Framework
inferred← citeshttps://doi.org/10.1007/s10472-006-9028-zopenalex-snapshot
Equilibrium logic
inferred← citeshttps://doi.org/10.1007/s10472-007-9075-0openalex-snapshot
Partial equilibrium logic
inferred← citeshttps://doi.org/10.1007/s10472-008-9087-4openalex-snapshot
On look-ahead heuristics in disjunctive logic programming
inferred← citeshttps://doi.org/10.1007/s10472-008-9090-9openalex-snapshot
Enhancing DLV instantiator by backjumping techniques
inferred← citeshttps://doi.org/10.1007/s10817-008-9106-5openalex-snapshot
Computing Only Minimal Answers in Disjunctive Deductive Databases
inferred← citeshttps://doi.org/10.1007/s11225-009-9210-5openalex-snapshot
Complete Extensions in Argumentation Coincide with 3-Valued Stable Models in Logic Programming
inferred← citeshttps://doi.org/10.1007/s11390-007-9078-7openalex-snapshot
Comparison of Semantics of Disjunctive Logic Programs Based on Model-Equivalent Reduction
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/0304-3975(95)00192-1openalex-snapshot
Querying disjunctive databases through nonmonotonic logics
inferred← citeshttps://doi.org/10.1016/0743-1066(93)90028-fopenalex-snapshot
An overview of nonmonotonic reasoning and logic programming
inferred← citeshttps://doi.org/10.1016/0743-1066(93)90029-gopenalex-snapshot
A survey of complexity results for non-monotonic logics
inferred← citeshttps://doi.org/10.1016/0743-1066(94)00026-3openalex-snapshot
Negation and minimality in disjunctive databases
inferred← citeshttps://doi.org/10.1016/0743-1066(94)90024-8openalex-snapshot
Logic programming and negation: A survey
inferred← citeshttps://doi.org/10.1016/0743-1066(94)90025-6openalex-snapshot
Logic programming and knowledge representation
inferred← citeshttps://doi.org/10.1016/b978-0-444-51624-4.50013-7openalex-snapshot
Logic and Databases: A History of Deductive Databases
inferred← citeshttps://doi.org/10.1016/j.artint.2009.10.003openalex-snapshot
Bounded treewidth as a key to tractability of knowledge representation and reasoning
inferred← citeshttps://doi.org/10.1016/j.artint.2011.01.007openalex-snapshot
Local closed world reasoning with description logics under the well-founded semantics
inferred← citeshttps://doi.org/10.1016/j.artint.2014.07.008openalex-snapshot
Finding explanations of inconsistency in multi-context systems
inferred← citeshttps://doi.org/10.1016/j.artint.2016.01.011openalex-snapshot
Semi-equilibrium models for paracoherent answer set programs
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.2021.103519openalex-snapshot
Paracoherent answer set computation
inferred← citeshttps://doi.org/10.1016/j.datak.2010.01.005openalex-snapshot
The consistency extractor system: Answer set programs for consistent query answering in databases
inferred← citeshttps://doi.org/10.1016/j.ijar.2014.12.004openalex-snapshot
On the equivalence between logic programming semantics and argumentation semantics
inferred← citeshttps://doi.org/10.1016/j.ijar.2017.02.005openalex-snapshot
Labellings for assumption-based and abstract argumentation
inferred← citeshttps://doi.org/10.1016/j.jal.2004.07.023openalex-snapshot
Deductive databases for computing certain and consistent answers from mediated data integration systems
inferred← citeshttps://doi.org/10.1016/j.jal.2009.12.001openalex-snapshot
Equivalence for the G 3 ′ -stable models semantics
inferred← citeshttps://doi.org/10.1016/j.jalgor.2008.02.003openalex-snapshot
Experimenting with parallelism for the instantiation of ASP programs
inferred← citeshttps://doi.org/10.1016/s0004-3702(00)00054-0openalex-snapshot
Prioritized logic programming and its application to commonsense reasoning
inferred← citeshttps://doi.org/10.1016/s0004-3702(02)00187-xopenalex-snapshot
Extending and implementing the stable model semantics
inferred← citeshttps://doi.org/10.1016/s0004-3702(03)00078-xopenalex-snapshot
Enhancing disjunctive logic programming systems by SAT checkers
inferred← citeshttps://doi.org/10.1016/s0004-3702(97)00032-5openalex-snapshot
Autoepistemic logic of knowledge and beliefs
inferred← citeshttps://doi.org/10.1016/s0004-3702(97)00060-xopenalex-snapshot
Reasoning with minimal models: efficient algorithms and applications
inferred← citeshttps://doi.org/10.1016/s0169-023x(97)00026-8openalex-snapshot
Top-down query processing in indefinite stratified databases
inferred← citeshttps://doi.org/10.1016/s0169-023x(99)00015-4openalex-snapshot
On cyclic covers and perfect models
inferred← citeshttps://doi.org/10.1016/s0304-3975(96)00179-xopenalex-snapshot
Abduction from logic programs: Semantics and complexity
inferred← citeshttps://doi.org/10.1016/s0304-3975(96)00182-xopenalex-snapshot
On compact representations of propositional circumscription
inferred← citeshttps://doi.org/10.1016/s0304-3975(97)00129-1openalex-snapshot
Expressive power and complexity of partial models for disjunctive deductive databases
inferred← citeshttps://doi.org/10.1016/s0743-1066(00)00004-2openalex-snapshot
Argumentation-based abduction in disjunctive logic programming
inferred← citeshttps://doi.org/10.1016/s0743-1066(96)00091-xopenalex-snapshot
Update by means of inference rules
inferred← citeshttps://doi.org/10.1016/s0743-1066(96)00106-9openalex-snapshot
Stable models are generated by a stable chain
inferred← citeshttps://doi.org/10.1016/s0743-1066(96)00115-xopenalex-snapshot
Characterizations of the disjunctive stable semantics by partial evaluation
inferred← citeshttps://doi.org/10.1016/s0743-1066(96)00116-1openalex-snapshot
Model generation and state generation for disjunctive logic programs
inferred← citeshttps://doi.org/10.1016/s0743-1066(96)00120-3openalex-snapshot
Partial deduction in disjunctive logic programming
inferred← citeshttps://doi.org/10.1016/s0743-1066(97)00027-7openalex-snapshot
Expressiveness of stable model semantics for disjunctive logic programs with functions
inferred← citeshttps://doi.org/10.1016/s0743-1066(97)10001-2openalex-snapshot
Negation as failure in the head
inferred← citeshttps://doi.org/10.1016/s0743-1066(97)10006-1openalex-snapshot
A logical foundation for logic programming II: Semantics of general logic programs
inferred← citeshttps://doi.org/10.1016/s0743-1066(98)10015-8openalex-snapshot
Stable inference as intuitionistic validity
inferred← citeshttps://doi.org/10.1016/s0743-1066(98)10030-4openalex-snapshot
Semantics of (disjunctive) logic programs based on partial evaluation
inferred← citeshttps://doi.org/10.1016/s0743-1066(99)00008-4openalex-snapshot
Stable generated models, partial temporal logic and disjunctive defaults
inferred← citeshttps://doi.org/10.1016/s0743-1066(99)00066-7openalex-snapshot
More on tractable disjunctive Datalog
inferred← citeshttps://doi.org/10.1016/s0743-1066(99)00073-4openalex-snapshot
Abductive logic programming and disjunctive logic programming: their relationship and transferability
inferred← citeshttps://doi.org/10.1017/s1471068403001704openalex-snapshot
Minimal founded semantics for disjunctive logic programs and deductive databases
inferred← citeshttps://doi.org/10.1017/s1471068404002273openalex-snapshot
Optimization of bound disjunctive queries with constraints
inferred← citeshttps://doi.org/10.1017/s1471068404002315openalex-snapshot
Preferred answer sets for ordered logic programs
inferred← citeshttps://doi.org/10.1017/s1471068405002577openalex-snapshot
Towards automated integration of guess and check programs in answer set programming: a meta-interpreter and applications
inferred← citeshttps://doi.org/10.1017/s147106840700302xopenalex-snapshot
Logic programs with monotone abstract constraint atoms
inferred← citeshttps://doi.org/10.1017/s1471068409003767openalex-snapshot
CP-logic: A language of causal probabilistic events and its relation to logic programming
inferred← citeshttps://doi.org/10.1017/s1471068409990056openalex-snapshot
Characterizations of stable model semantics for logic programs with arbitrary constraint atoms
inferred← citeshttps://doi.org/10.1017/s147106840999010xopenalex-snapshot
Characterising equilibrium logic and nested logic programs: Reductions and complexity,
inferred← citeshttps://doi.org/10.1017/s1471068415000113openalex-snapshot
A model building framework for answer set programming with external computations
inferred← citeshttps://doi.org/10.1017/s1471068415000186openalex-snapshot
Dual-normal logic programs – the forgotten class
inferred← citeshttps://doi.org/10.1017/s1471068419000139openalex-snapshot
Paracoherent Answer Set Semantics meets Argumentation Frameworks
inferred← citeshttps://doi.org/10.1017/s1471068419000176openalex-snapshot
Better Paracoherent Answer Sets with Less Resources
inferred← citeshttps://doi.org/10.1017/s1471068419000449openalex-snapshot
A Logic-Based Framework Leveraging Neural Networks for Studying the Evolution of Neurological Disorders
inferred← citeshttps://doi.org/10.1017/s1471068425100070openalex-snapshot
Argumentative Characterizations of (Extended) Disjunctive Logic Programs
inferred← citeshttps://doi.org/10.1023/a:1005900924623openalex-snapshot
'Classical' Negation in Nonmonotonic Reasoning and Logic Programming
inferred← citeshttps://doi.org/10.1023/a:1005952908693openalex-snapshot
Characterizations of the Disjunctive Well-Founded Semantics: Confluent Calculi and Iterated GCWA
inferred← citeshttps://doi.org/10.1023/a:1010744127526openalex-snapshot
On the Computation of the Disjunctive Well-Founded Semantics
inferred← citeshttps://doi.org/10.1023/a:1011271902410openalex-snapshot
An Extension to GCWA and Query Evaluation for Disjunctive Deductive Databases
inferred← citeshttps://doi.org/10.1023/a:1013180132511openalex-snapshot
Using clausal deductive databases for defining semantics in disjunctive deductive databases
inferred← citeshttps://doi.org/10.1023/a:1018947420290openalex-snapshot
On the partial semantics for disjunctive deductive databases
inferred← citeshttps://doi.org/10.1023/a:1018951805211openalex-snapshot
Logic knowledge bases with two default rules
inferred← citeshttps://doi.org/10.1023/a:1018986207453openalex-snapshot
Semantics and expressiveness of disjunctive ordered logic
inferred← citeshttps://doi.org/10.1080/11663081.2013.799318openalex-snapshot
Model-based recasting in answer-set programming
inferred← citeshttps://doi.org/10.1093/comjnl/bxm056openalex-snapshot
Fixed-Parameter Algorithms For Artificial Intelligence, Constraint Satisfaction and Database Problems
inferred← citeshttps://doi.org/10.1093/logcom/13.3.405openalex-snapshot
Collective Argumentation and Disjunctive Logic Programming
inferred← citeshttps://doi.org/10.1093/logcom/5.3.265openalex-snapshot
Paraconsistent Stable Semantics for Extended Disjunctive Programs
inferred← citeshttps://doi.org/10.1109/69.877512openalex-snapshot
Enhancing Disjunctive Datalog by constraints
inferred← citeshttps://doi.org/10.1109/ccc.1997.612304openalex-snapshot
Complexity and expressive power of logic programming
inferred← citeshttps://doi.org/10.1109/sccc.2011.9openalex-snapshot
CQA-WF: Consistent Query Answers to Conjunctive Queries Using the Well-Founded Semantics
inferred← citeshttps://doi.org/10.1109/tkde.2003.1185840openalex-snapshot
Binding propagation techniques for the optimization of bound disjunctive queries
inferred← citeshttps://doi.org/10.1111/0824-7935.00168openalex-snapshot
Semantic Forcing in Disjunctive Logic Programs
inferred← citeshttps://doi.org/10.1111/j.1467-8640.1995.tb00024.xopenalex-snapshot
COMPUTING PERFECT AND STABLE MODELS USING ORDERED MODEL TREES
showing the first 200 of 254 · page through all 254
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.