On the public citation graph

On the computational cost of disjunctive logic programming: Propositional case

0 signed · 369 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-56039-4_31openalex-snapshot

Semantics of disjunctive deductive databases

inferredcites →https://doi.org/10.1007/3-540-57292-9_51openalex-snapshot

Logic programming and autoepistemic logics: New relations and complexity results

inferredcites →https://doi.org/10.1007/978-1-4684-3384-5_3openalex-snapshot

On Closed World Data Bases

inferredcites →https://doi.org/10.1007/bf00244994openalex-snapshot

Deduction in non-Horn databases

inferredcites →https://doi.org/10.1007/bf00248321openalex-snapshot

Weak Generalized Closed World Assumption

inferredcites →https://doi.org/10.1007/bf00297247openalex-snapshot

Inferring negative information from disjunctive databases

inferredcites →https://doi.org/10.1007/bf01530761openalex-snapshot

Propositional semantics for disjunctive logic programs

inferredcites →https://doi.org/10.1007/bf01531080openalex-snapshot

A theory of nonmonotonic rule systems I

inferredcites →https://doi.org/10.1007/bf01534455openalex-snapshot

The expressiveness of locally stratified programs

inferredcites →https://doi.org/10.1007/bf01536401openalex-snapshot

Complexity of computing with extended propositional logic programs

inferredcites →https://doi.org/10.1007/bf01543473openalex-snapshot

Generalized disjunctive well-founded semantics for logic programs

inferredcites →https://doi.org/10.1007/bf01543477openalex-snapshot

A theory of nonmonotonic rule systems II

inferredcites →https://doi.org/10.1007/bf03037169openalex-snapshot

Classical negation in logic programs and disjunctive databases

inferredcites →https://doi.org/10.1007/bf03037171openalex-snapshot

Stable semantics for disjunctive programs

inferredcites →https://doi.org/10.1007/bfb0000066openalex-snapshot

On indefinite databases and the closed world assumption

inferredcites →https://doi.org/10.1016/0004-3702(80)90011-9openalex-snapshot

Circumscription—A form of non-monotonic reasoning

inferredcites →https://doi.org/10.1016/0004-3702(80)90014-4openalex-snapshot

A logic for default reasoning

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(86)90001-9openalex-snapshot

Negation as failure

inferredcites →https://doi.org/10.1016/0004-3702(86)90032-9openalex-snapshot

Applications of circumscription to formalizing common-sense knowledge

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(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/0020-0190(90)90012-mopenalex-snapshot

Generalized Closed World Assumption is II02-Complete

inferredcites →https://doi.org/10.1016/0020-0190(92)90049-2openalex-snapshot

The complexity of model checking for circumscriptive formulae

inferredcites →https://doi.org/10.1016/0168-0072(92)90069-copenalex-snapshot

How complicated is the set of stable models of a recursive logic program?

inferredcites →https://doi.org/10.1016/0304-3975(51)90004-7openalex-snapshot

Negation by default and unstratifiable logic programs

inferredcites →https://doi.org/10.1016/0304-3975(93)90073-3openalex-snapshot

Propositional circumscription and extended closed-world reasoning are ΠP2-complete

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

Horn clause queries and generalizations

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/0743-1066(93)90029-gopenalex-snapshot

A survey of complexity results for non-monotonic logics

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-88071-0.50007-2openalex-snapshot

A Catalog of Complexity Classes

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/c2013-0-07699-2openalex-snapshot

Foundations of Deductive Databases and Logic Programming

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

Complexity Results for Nonmonotonic Logics

inferredcites →https://doi.org/10.1109/69.219736openalex-snapshot

A possible world semantics for disjunctive databases

inferredcites →https://doi.org/10.1137/0219058openalex-snapshot

Bounded Query Classes

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/800125.804029openalex-snapshot

Word problems requiring exponential time(Preliminary Report)

inferredcites →https://doi.org/10.21236/ada232064openalex-snapshot

Generalized Disjunctive Well-Founded Semantics for Logic Programs

inferredcites →https://doi.org/10.3233/fi-1990-13103openalex-snapshot

Arithmetic Classification of Perfect Models of Stratified Programs

inferredcites →https://doi.org/10.3233/fi-1992-171-204openalex-snapshot

Reasoning with Parsimonious and Moderately Grounded Expansions

inferredcites →https://doi.org/10.3233/fi-1994-2144openalex-snapshot

THE COMPLEXITY OF LOCAL STRATIFICATION

inferredcites →https://doi.org/10.7551/mitpress/4307.003.0007openalex-snapshot

Implementing Semantics of Disjunctive Logic Programs Using Fringes and Abstract Properties

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.2139/ssrn.3199227openalex-extracted

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/10703163_6openalex-snapshot

Revision Programming = Logic Programming + Integrity Constraints

inferred← citeshttps://doi.org/10.1007/11499107_26openalex-snapshot

Model-Equivalent Reductions

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

Solving Hard ASP Programs Efficiently

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

circ2dlp — Translating Circumscription into Disjunctive Logic Programming

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_7openalex-snapshot

On the Effect of Default Negation on the Expressiveness of Disjunctive Rules

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-45628-7_21openalex-snapshot

Multiagent Compromises, Joint Fixpoints, and Stable Models

inferred← citeshttps://doi.org/10.1007/3-540-45656-2_54openalex-snapshot

The Complexity of Logic Program Updates

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-46767-x_21openalex-snapshot

Extending Disjunctive Logic Programming by T-norms

inferred← citeshttps://doi.org/10.1007/3-540-49201-1_21openalex-snapshot

Developing a Declarative Rule Language for Applications in Product Configuration

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

An abductive framework for negation in disjunctive logic programming

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

Strong and weak constraints in disjunctive datalog

inferred← citeshttps://doi.org/10.1007/3540635149_31openalex-snapshot

On the complexity of some Inductive Logic Programming problems

inferred← citeshttps://doi.org/10.1007/978-1-4615-1567-8_21openalex-snapshot

Extending the Smodels System with Cardinality and Weight Constraints

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-19570-0_51openalex-snapshot

Stable-Ordered Models for Propositional Theories with Order Operators

inferred← citeshttps://doi.org/10.1007/978-3-030-20528-7_9openalex-snapshot

Treewidth and Counting Projected Answer Sets

inferred← citeshttps://doi.org/10.1007/978-3-030-60327-4_11openalex-snapshot

Synthesis and Simulation of Ensembles of Boolean Networks for Cell Fate Decision

inferred← citeshttps://doi.org/10.1007/978-3-030-85633-5_10openalex-snapshot

Learning Boolean Controls in Regulated Metabolic Networks: A Case-Study

inferred← citeshttps://doi.org/10.1007/978-3-030-94479-7_2openalex-snapshot

Modelling the Outlier Detection Problem in ASP(Q)

inferred← citeshttps://doi.org/10.1007/978-3-030-94479-7_4openalex-snapshot

Determining Action Reversibility in STRIPS Using Answer Set Programming with Quantifiers

inferred← citeshttps://doi.org/10.1007/978-3-030-94479-7_9openalex-snapshot

Implementing Stable-Unstable Semantics with ASPTOOLS and Clingo

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_29openalex-snapshot

Solving Problems in the Polynomial Hierarchy with ASP(Q)

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-031-29168-5_11openalex-snapshot

Less is Better: Constructing Legal Question Answering System by Weighing Longest Common Subsequence of Disjunctive Union Text

inferred← citeshttps://doi.org/10.1007/978-3-031-43619-2_50openalex-snapshot

Computing MUS-Based Inconsistency Measures

inferred← citeshttps://doi.org/10.1007/978-3-031-76235-2_17openalex-snapshot

Inconsistency Measurement in LTL$$_{\text {f}}$$ Based on Minimal Inconsistent Sets and Minimal Correction Sets

inferred← citeshttps://doi.org/10.1007/978-3-031-97007-8_2openalex-snapshot

Extracting Specifications Through Verified and Explainable AI: Interpretability, Interoperability, and Trade-Offs

inferred← citeshttps://doi.org/10.1007/978-3-032-04587-4_12openalex-snapshot

deon-$$\mathcal {B}$$: A Language for Well-Founded Deontic Planning

inferred← citeshttps://doi.org/10.1007/978-3-032-04587-4_14openalex-snapshot

Towards Practicable Defeasible Reasoning for ABoxes

inferred← citeshttps://doi.org/10.1007/978-3-032-04587-4_20openalex-snapshot

Encoding Action Reversibility In Planning Using Quantified ASP and Bule

inferred← citeshttps://doi.org/10.1007/978-3-032-15981-6_12openalex-snapshot

Solving Hard Combinatorial Optimization Problems with PyQASP

inferred← citeshttps://doi.org/10.1007/978-3-032-40774-0_5openalex-snapshot

Declarative Verification of Binary Neural Networks

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-23264-5_31openalex-snapshot

Progress in clasp Series 3

inferred← citeshttps://doi.org/10.1007/978-3-319-23264-5_43openalex-snapshot

Logic Programming with Graded Modality

inferred← citeshttps://doi.org/10.1007/978-3-319-23264-5_44openalex-snapshot

The Design of the Sixth Answer Set Programming Competition

inferred← citeshttps://doi.org/10.1007/978-3-319-61033-7_7openalex-snapshot

Answer Set Programming with External Source Access

inferred← citeshttps://doi.org/10.1007/978-3-319-61581-3_40openalex-snapshot

The Complexity of Inferences and Explanations in Probabilistic Logic Programming

inferred← citeshttps://doi.org/10.1007/978-3-319-61660-5_1openalex-snapshot

The Design of the Seventh Answer Set Programming Competition

inferred← citeshttps://doi.org/10.1007/978-3-319-61660-5_15openalex-snapshot

Answer Set Programs with Queries over Subprograms

inferred← citeshttps://doi.org/10.1007/978-3-319-90050-6_6openalex-snapshot

ASP Programs with Groundings of Small Treewidth

inferred← citeshttps://doi.org/10.1007/978-3-540-24599-5_15openalex-snapshot

Computing Minimal Models, Stable Models, and Answer Sets

inferred← citeshttps://doi.org/10.1007/978-3-540-24609-1_17openalex-snapshot

Verifying the Equivalence of Logic Programs in the Disjunctive Case

inferred← citeshttps://doi.org/10.1007/978-3-540-24609-1_20openalex-snapshot

Improving the Model Generation/Checking Interplay to Enhance the Evaluation of Disjunctive Programs

inferred← citeshttps://doi.org/10.1007/978-3-540-24609-1_29openalex-snapshot

GNT — A Solver for Disjunctive Logic Programs

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-27775-0_16openalex-snapshot

On Acyclic and Head-Cycle Free Nested Logic Programs

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-30597-2_4openalex-snapshot

Representing Paraconsistent Reasoning via Quantified Propositional Logic

inferred← citeshttps://doi.org/10.1007/978-3-540-72200-7_11openalex-snapshot

Experimenting with Look-Back Heuristics for Hard ASP Programs

inferred← citeshttps://doi.org/10.1007/978-3-540-74610-2_40openalex-snapshot

Computing Fuzzy Answer Sets Using dlvhex

inferred← citeshttps://doi.org/10.1007/978-3-540-74610-2_6openalex-snapshot

Logic Programming for Knowledge Representation

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-75560-9_37openalex-snapshot

$\mathbb{FDNC}$ : Decidable Non-monotonic Disjunctive Logic Programs with Function Symbols

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-85928-4_21openalex-snapshot

Brave Induction

inferred← citeshttps://doi.org/10.1007/978-3-540-89982-2_19openalex-snapshot

Detecting Inconsistencies in Large Biological Networks with Answer Set Programming

inferred← citeshttps://doi.org/10.1007/978-3-540-89982-2_28openalex-snapshot

Declarative Semantics for Active Integrity Constraints

inferred← citeshttps://doi.org/10.1007/978-3-540-89982-2_48openalex-snapshot

Relativized Hyperequivalence of Logic Programs for Modular Programming

inferred← citeshttps://doi.org/10.1007/978-3-540-93920-7_10openalex-snapshot

Inductive Negotiation in Answer Set Programming

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-02846-5_27openalex-snapshot

Metabolic Network Expansion with Answer Set Programming

inferred← citeshttps://doi.org/10.1007/978-3-642-03754-2_2openalex-snapshot

Answer Set Programming: A Primer

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

Trichotomy Results on the Complexity of Reasoning with Disjunctive Logic Programs

inferred← citeshttps://doi.org/10.1007/978-3-642-13073-1_27openalex-snapshot

The Complexity of Computing Minimal Unidirectional Covering Sets

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

Revisiting Epistemic Specifications

inferred← citeshttps://doi.org/10.1007/978-3-642-20895-9_30openalex-snapshot

cmMUS: A Tool for Circumscription-Based MUS Membership Testing

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

Inline Evaluation of Hybrid Knowledge Bases

inferred← citeshttps://doi.org/10.1007/978-3-642-30743-0_32openalex-snapshot

Disjunctive Programs with Set Constraints

inferred← citeshttps://doi.org/10.1007/978-3-642-30743-0_39openalex-snapshot

Well-Supported Semantics for Logic Programs with Generalized Rules

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

Backdoors to Satisfaction

inferred← citeshttps://doi.org/10.1007/978-3-642-31467-4_6openalex-snapshot

The Good, the Bad, and the Odd: Cycles in Answer-Set Programs

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

Experiments with Reduction Finding

inferred← citeshttps://doi.org/10.1007/978-3-642-40564-8_55openalex-snapshot

On Optimal Solutions of Answer Set Optimization Problems

inferred← citeshttps://doi.org/10.1007/978-3-642-40564-8_7openalex-snapshot

The Complexity Boundary of Answer Set Programming with Generalized Atoms under the FLP Semantics

inferred← citeshttps://doi.org/10.1007/978-3-642-41524-1_2openalex-snapshot

The Parameterized Complexity of Constraint Satisfaction and Reasoning

inferred← citeshttps://doi.org/10.1007/978-3-642-41524-1_7openalex-snapshot

Making Use of Advances in Answer-Set Programming for Abstract Argumentation Systems

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/bf02948986openalex-snapshot

Closed world assumption for disjunctive reasoning

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

On the complexity of some inductive logic programming problems

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/bfb0058028openalex-snapshot

An abductive semantics for disjunctive logic programs and its proof procedure

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/s00224-012-9437-9openalex-snapshot

The Complexity of Computing Minimal Unidirectional Covering Sets

inferred← citeshttps://doi.org/10.1007/s10458-015-9313-5openalex-snapshot

Exact and heuristic methods for solving Boolean games

inferred← citeshttps://doi.org/10.1007/s10458-023-09598-6openalex-snapshot

Egalitarian judgment aggregation

inferred← citeshttps://doi.org/10.1007/s10472-006-9028-zopenalex-snapshot

Equilibrium logic

inferred← citeshttps://doi.org/10.1007/s10472-008-9086-5openalex-snapshot

Complexity results for answer set programming with bounded predicate arities and implications

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-010-9220-zopenalex-snapshot

Detecting and repairing anomalous evolutions in noisy environments

inferred← citeshttps://doi.org/10.1007/s10472-019-09633-xopenalex-snapshot

A multiparametric view on answer set programming

inferred← citeshttps://doi.org/10.1007/s10489-019-01575-5openalex-snapshot

Faster horn diagnosis - a performance comparison of abductive reasoning algorithms

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/s10994-009-5113-yopenalex-snapshot

Brave induction: a logical framework for learning from incomplete information

inferred← citeshttps://doi.org/10.1007/s10994-013-5344-9openalex-snapshot

Interactive relational reinforcement learning of concept semantics

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/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/b978-044450813-3/50021-7openalex-snapshot

Nonmonotonic Reasoning: Towards Efficient Calculi and Implementations

inferred← citeshttps://doi.org/10.1016/j.artint.2008.04.002openalex-snapshot

Combining answer set programming with description logics for the Semantic Web

inferred← citeshttps://doi.org/10.1016/j.artint.2008.05.002openalex-snapshot

Semantic forgetting in answer set programming

inferred← citeshttps://doi.org/10.1016/j.artint.2008.07.004openalex-snapshot

Outlier detection using default reasoning

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.2010.04.002openalex-snapshot

Semantics and complexity of recursive aggregates in answer set programming

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.2013.10.001openalex-snapshot

Complexity-sensitive decision procedures for abstract argumentation

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.2014.07.008openalex-snapshot

Finding explanations of inconsistency in multi-context systems

inferred← citeshttps://doi.org/10.1016/j.artint.2014.11.008openalex-snapshot

Methods for solving reasoning problems in abstract argumentation – A survey

inferred← citeshttps://doi.org/10.1016/j.artint.2014.12.001openalex-snapshot

Backdoors to tractable answer set programming

inferred← citeshttps://doi.org/10.1016/j.artint.2015.09.008openalex-snapshot

Design and results of the Fifth Answer Set Programming Competition

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.2016.04.004openalex-snapshot

Evaluating epistemic negation in answer set programming

inferred← citeshttps://doi.org/10.1016/j.artint.2018.03.005openalex-snapshot

The complexity and generality of learning answer set programs

inferred← citeshttps://doi.org/10.1016/j.artint.2018.04.003openalex-snapshot

LARS: A Logic-based framework for Analytic Reasoning over Streams

inferred← citeshttps://doi.org/10.1016/j.artint.2018.11.002openalex-snapshot

Strong inconsistency

inferred← citeshttps://doi.org/10.1016/j.artint.2019.04.002openalex-snapshot

The 2016 and 2017 QBF solvers evaluations (QBFEVAL'16 and QBFEVAL'17)

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.103165openalex-snapshot

Determining inference semantics for disjunctive logic programs

inferred← citeshttps://doi.org/10.1016/j.artint.2019.103185openalex-snapshot

New models for generating hard random boolean formulas and disjunctive logic programs

inferred← citeshttps://doi.org/10.1016/j.artint.2020.103307openalex-snapshot

On the limits of forgetting in Answer Set Programming

inferred← citeshttps://doi.org/10.1016/j.artint.2020.103344openalex-snapshot

Handling and measuring inconsistency in non-monotonic logics

inferred← citeshttps://doi.org/10.1016/j.artint.2021.103651openalex-snapshot

Treewidth-aware reductions of normal ASP to SAT – Is normal ASP harder than SAT after all?

inferred← citeshttps://doi.org/10.1016/j.artint.2023.104023openalex-snapshot

A general framework for preferences in answer set programming

inferred← citeshttps://doi.org/10.1016/j.artint.2024.104205openalex-snapshot

Abstract argumentation frameworks with strong and weak constraints

inferred← citeshttps://doi.org/10.1016/j.artint.2024.104230openalex-snapshot

Adaptive large-neighbourhood search for optimisation in answer-set programming

inferred← citeshttps://doi.org/10.1016/j.artint.2026.104600openalex-snapshot

Body-decoupled grounding via reduction: A novel approach on the Asp bottleneck

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.2013.11.002openalex-snapshot

Using possibilistic logic for modeling qualitative decision: Answer Set Programming algorithms

inferred← citeshttps://doi.org/10.1016/j.ijar.2015.01.004openalex-snapshot

Possibilistic nested logic programs and strong equivalence

inferred← citeshttps://doi.org/10.1016/j.ijar.2019.04.010openalex-snapshot

EMIL: Extracting Meaning from Inconsistent Language

inferred← citeshttps://doi.org/10.1016/j.ijar.2019.12.003openalex-snapshot

Complexity results for probabilistic answer set programming

inferred← citeshttps://doi.org/10.1016/j.ijar.2023.109040openalex-snapshot

Lifted inference for statistical statements in probabilistic answer set programming

inferred← citeshttps://doi.org/10.1016/j.jal.2008.10.006openalex-snapshot

Equivalence issues in abduction and induction

inferred← citeshttps://doi.org/10.1016/j.jalgor.2008.02.006openalex-snapshot

Look-back techniques and heuristics in DLV: Implementation, evaluation, and comparison to QBF solvers

inferred← citeshttps://doi.org/10.1016/j.tcs.2006.07.054openalex-snapshot

Reasoning under minimal upper bounds in propositional logic

inferred← citeshttps://doi.org/10.1016/j.websem.2016.02.002openalex-snapshot

A Rule-Based Agent-Oriented Approach for Supporting Weakly-Structured Scientific Workflows

inferred← citeshttps://doi.org/10.1016/j.websem.2022.100721openalex-snapshot

Satisfiability and containment of recursive SHACL

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(02)00207-2openalex-snapshot

Logic programming and knowledge representation—The A-Prolog perspective

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/s0304-3975(01)00383-8openalex-snapshot

Propositional default logics made easier: computational complexity of model checking

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(97)00129-1openalex-snapshot

Expressive power and complexity of partial models for disjunctive deductive databases

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(99)00066-7openalex-snapshot