On the public citation graph

Propositional semantics for disjunctive logic programs

https://doi.org/10.1007/bf01530761
0 signed · 238 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/978-1-4613-8788-6_11openalex-snapshot
Network-Based Heuristics for Constraint-Satisfaction Problems
inferredcites →https://doi.org/10.1007/978-1-4684-3384-5_11openalex-snapshot
Negation as Failure
inferredcites →https://doi.org/10.1007/bf00243002openalex-snapshot
On the declarative and procedural semantics of logic programs
inferredcites →https://doi.org/10.1007/bf03037169openalex-snapshot
Classical negation in logic programs and disjunctive databases
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(87)90002-6openalex-snapshot
Network-based heuristics for constraint-satisfaction problems
inferredcites →https://doi.org/10.1016/0004-3702(89)90037-4openalex-snapshot
Tree clustering for constraint networks
inferredcites →https://doi.org/10.1016/0004-3702(90)90046-3openalex-snapshot
Enhancement schemes for constraint processing: Backjumping, learning, and cutset decomposition
inferredcites →https://doi.org/10.1016/0004-3702(90)90086-fopenalex-snapshot
A rational reconstruction of nonmonotonic truth maintenance systems
inferredcites →https://doi.org/10.1016/0004-3702(91)90011-8openalex-snapshot
Hard problems for simple default logics
inferredcites →https://doi.org/10.1016/0743-1066(90)90033-2openalex-snapshot
A fixpoint 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/s0049-237x(08)70050-8openalex-snapshot
The Justification of Negation as Failure
inferredcites →https://doi.org/10.1109/69.390244openalex-snapshot
WFS + branch and bound = stable models
inferredcites →https://doi.org/10.1137/0201010openalex-snapshot
Depth-First Search and Linear Graph Algorithms
inferredcites →https://doi.org/10.1137/0608024openalex-snapshot
Complexity of Finding Embeddings in a k -Tree
inferredcites →https://doi.org/10.1145/116825.116836openalex-snapshot
Autoepistemic logic
inferredcites →https://doi.org/10.1145/4221.4225openalex-snapshot
A sufficient condition for backtrack-bounded search
inferredcites →https://doi.org/10.21236/ada299227openalex-snapshot
Computation and Implementation of Non-Monotonic Deductive Databases.
inferredcites →https://doi.org/10.21236/ada455012openalex-snapshot
WFS + Branch and Bound = Stable Models
inferredcites →https://doi.org/10.5040/9798400614842openalex-snapshot
Encyclopedia of Artificial Intelligence

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/1-4020-3092-4_1openalex-snapshot
Knowledge Representation with Logic Programs
inferred← citeshttps://doi.org/10.1007/11546207_19openalex-snapshot
Solving Hard ASP Programs Efficiently
inferred← citeshttps://doi.org/10.1007/11562931_18openalex-snapshot
Reducing Inductive Definitions to Propositional Satisfiability
inferred← citeshttps://doi.org/10.1007/11750734_18openalex-snapshot
Combining Answer Sets of Nonmonotonic Logic Programs
inferred← citeshttps://doi.org/10.1007/11799573_17openalex-snapshot
Generality Relations in Answer Set Programming
inferred← citeshttps://doi.org/10.1007/11896548_27openalex-snapshot
Semantically Correct Query Answers in the Presence of Null Values
inferred← citeshttps://doi.org/10.1007/3-540-36388-2_15openalex-snapshot
Logic Programs for Querying Inconsistent Databases
inferred← citeshttps://doi.org/10.1007/3-540-36596-6_2openalex-snapshot
Characterizing and Computing Semantically Correct Answers from Databases with Annotated Logic and Answer Sets
inferred← citeshttps://doi.org/10.1007/3-540-36596-6_3openalex-snapshot
Towards Unifying Semantic Constraints and Security Constraints
inferred← citeshttps://doi.org/10.1007/3-540-45153-6_22openalex-snapshot
Stratified Partial-Order Logic Programming
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-45656-2_54openalex-snapshot
The Complexity of Logic Program Updates
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-46767-x_8openalex-snapshot
Transformations of Logic Programs Related to Causality and Planning
inferred← citeshttps://doi.org/10.1007/3-540-47922-8_11openalex-snapshot
Two-Literal Logic Programs and Satisfiability Representation of Stable Models: A Comparison
inferred← citeshttps://doi.org/10.1007/3-540-58495-1_50openalex-snapshot
Classical methods in nonmonotonic reasoning
inferred← citeshttps://doi.org/10.1007/3-540-59487-6_20openalex-snapshot
Reasoning with stratified default theories
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/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-3-030-05998-9_1openalex-snapshot
Strong Equivalence and Program’s Structure in Arguing Essential Equivalence Between First-Order Logic Programs
inferred← citeshttps://doi.org/10.1007/978-3-030-20528-7_18openalex-snapshot
Evaluation of Disjunctive Programs in WASP
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-31041-7_12openalex-snapshot
Fuzzy Answer Set Programming: From Theory to Practice
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-031-11321-5_3openalex-snapshot
Assumption-Based Argumentation for Extended Disjunctive Logic Programming
inferred← citeshttps://doi.org/10.1007/978-3-031-15707-3openalex-snapshot
Logic Programming and Nonmonotonic Reasoning
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_38openalex-snapshot
Solving Disjunctive Fuzzy Answer Set Programs
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-67162-8_11openalex-snapshot
P2P Deductive Databases: Well Founded Semantics and Distributed Computation
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-24599-5_31openalex-snapshot
Loop Formulas for Disjunctive Logic Programs
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-27775-0_16openalex-snapshot
On Acyclic and Head-Cycle Free Nested Logic Programs
inferred← citeshttps://doi.org/10.1007/978-3-540-30192-9_47openalex-snapshot
Query Answering in Peer-to-Peer Data Exchange Systems
inferred← citeshttps://doi.org/10.1007/978-3-540-72200-7_14openalex-snapshot
Head-Elementary-Set-Free Logic Programs
inferred← citeshttps://doi.org/10.1007/978-3-540-72200-7_16openalex-snapshot
Modularity Aspects of Disjunctive Stable Models
inferred← citeshttps://doi.org/10.1007/978-3-540-72200-7_20openalex-snapshot
Logic Programs with Abstract Constraints: Representaton, Disjunction and Complexities
inferred← citeshttps://doi.org/10.1007/978-3-540-72200-7_22openalex-snapshot
The $\mathcal{LP\mbox{-\,}OD}$ System: Logic Programming Meets Outlier Detection
inferred← citeshttps://doi.org/10.1007/978-3-540-74610-2_10openalex-snapshot
Extended ASP Tableaux and Rule Redundancy in Normal Logic Programs
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-89982-2_19openalex-snapshot
Detecting Inconsistencies in Large Biological Networks 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_14openalex-snapshot
Computing Stable Models via Reductions to Difference Logic
inferred← citeshttps://doi.org/10.1007/978-3-642-04238-6_33openalex-snapshot
Translating Preferred Answer Set Programs to Propositional Logic
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-15025-8_10openalex-snapshot
Finding Reductions Automatically
inferred← citeshttps://doi.org/10.1007/978-3-642-15675-5_33openalex-snapshot
DLV MC : Enhanced Model Checking in DLV
inferred← citeshttps://doi.org/10.1007/978-3-642-15918-3_12openalex-snapshot
Defeasibility in Answer Set Programs via Argumentation Theories
inferred← citeshttps://doi.org/10.1007/978-3-642-18690-5_2openalex-snapshot
Query Answering in Inconsistent Databases
inferred← citeshttps://doi.org/10.1007/978-3-642-20832-4_8openalex-snapshot
Compact Translations of Non-disjunctive Answer Set Programs to Propositional Clauses
inferred← citeshttps://doi.org/10.1007/978-3-642-34413-8_10openalex-snapshot
Evaluating Tree-Decomposition Based Algorithms for Answer Set Programming
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-40564-8_6openalex-snapshot
WASP: A Native ASP Solver Based on Constraint Learning
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-1834-5_3openalex-snapshot
Specifying and Querying Database Repairs using Logic Programs with Exceptions
inferred← citeshttps://doi.org/10.1007/bf00283131openalex-snapshot
On computing logic programs
inferred← citeshttps://doi.org/10.1007/bf01530759openalex-snapshot
Overview of disjunctive logic programming
inferred← citeshttps://doi.org/10.1007/bf01536399openalex-snapshot
On the computational cost of disjunctive logic programming: Propositional case
inferred← citeshttps://doi.org/10.1007/bf02127971openalex-snapshot
Polynomial-time computable stable models
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/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-009-9118-9openalex-snapshot
Stable models and difference logic
inferred← citeshttps://doi.org/10.1007/s10817-006-9033-2openalex-snapshot
Answer Set Programming Based on Propositional Satisfiability
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/s11390-007-9078-7openalex-snapshot
Comparison of Semantics of Disjunctive Logic Programs Based on Model-Equivalent Reduction
inferred← citeshttps://doi.org/10.1016/0004-3702(95)00095-xopenalex-snapshot
Default reasoning using classical logic
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)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-1-4832-1452-8.50101-9openalex-snapshot
Reasoning with minimal models: Efficient algorithms and applications
inferred← citeshttps://doi.org/10.1016/b978-1-4832-1452-8.50123-8openalex-snapshot
On Positive Occurrences of Negation as Failure
inferred← citeshttps://doi.org/10.1016/j.artint.2004.04.004openalex-snapshot
ASSAT: computing answer sets of a logic program by SAT solvers
inferred← citeshttps://doi.org/10.1016/j.artint.2005.06.003openalex-snapshot
An incremental algorithm for generating all minimal models
inferred← citeshttps://doi.org/10.1016/j.artint.2008.03.004openalex-snapshot
Heuristics for planning with penalties and rewards formulated in logic and computed through circuits
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.2011.11.001openalex-snapshot
Ordered completion for first-order logic programs on finite structures
inferred← citeshttps://doi.org/10.1016/j.artint.2014.02.003openalex-snapshot
On the tractability of minimal model computation for some CNF theories
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.03.006openalex-snapshot
Datalog rewritability of Disjunctive Datalog programs and non-Horn ontologies
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.2020.103438openalex-snapshot
Making sense of sensory input
inferred← citeshttps://doi.org/10.1016/j.artint.2021.103519openalex-snapshot
Paracoherent answer set computation
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.2022.103754openalex-snapshot
Graph-based construction of minimal models
inferred← citeshttps://doi.org/10.1016/j.artint.2024.104276openalex-snapshot
A simple proof-theoretic characterization of stable models: Reduction to difference logic and experiments
inferred← citeshttps://doi.org/10.1016/j.cmpb.2023.107817openalex-snapshot
Forming We-intentions under breakdown situations in human-robot interactions
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.tcs.2014.11.010openalex-snapshot
Restricted default theories: Expressive power and outlier detection tasks
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/s0004-3702(97)00060-xopenalex-snapshot
Reasoning with minimal models: efficient algorithms and applications
inferred← citeshttps://doi.org/10.1016/s0004-3702(99)00005-3openalex-snapshot
Heterogeneous active agents, I: Semantics
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(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(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.1016/s1574-6526(07)03007-6openalex-snapshot
Chapter 7 Answer Sets
inferred← citeshttps://doi.org/10.1017/s1471068402001138openalex-snapshot
Computing large and small stable models
inferred← citeshttps://doi.org/10.1017/s1471068403001704openalex-snapshot
Minimal founded semantics for disjunctive logic programs and deductive databases
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/s1471068407003158openalex-snapshot
Experimenting with recursive queries in database and logic programming systems
inferred← citeshttps://doi.org/10.1017/s1471068408003323openalex-snapshot
Design and implementation of aggregate functions in the DLV system
inferred← citeshttps://doi.org/10.1017/s1471068408003578openalex-snapshot
Extended ASP Tableaux and rule redundancy in normal 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/s1471068409990196openalex-snapshot
On the complexity of identifying head-elementary-set-free programs
inferred← citeshttps://doi.org/10.1017/s1471068410000463openalex-snapshot
Trichotomy and dichotomy results on the complexity of reasoning with disjunctive logic programs
inferred← citeshttps://doi.org/10.1017/s1471068410000554openalex-snapshot
Detecting inconsistencies in large biological networks with answer set programming
inferred← citeshttps://doi.org/10.1017/s1471068411000019openalex-snapshot
On elementary loops of logic programs
inferred← citeshttps://doi.org/10.1017/s147106841300001xopenalex-snapshot
Complexity of super-coherence problems in ASP
inferred← citeshttps://doi.org/10.1017/s1471068415000162openalex-snapshot
Knowledge compilation of logic programs using approximation fixpoint theory
inferred← citeshttps://doi.org/10.1017/s1471068415000186openalex-snapshot
Dual-normal logic programs – the forgotten class
inferred← citeshttps://doi.org/10.1017/s1471068415000241openalex-snapshot
Fuzzy answer set computation via satisfiability modulo theories
inferred← citeshttps://doi.org/10.1017/s1471068416000387openalex-snapshot
Stable-unstable semantics: Beyond NP with normal logic programs
inferred← citeshttps://doi.org/10.1017/s1471068417000217openalex-snapshot
Stepwise debugging of answer-set programs
inferred← citeshttps://doi.org/10.1017/s1471068419000036openalex-snapshot
Optimizing Answer Set Computation via Heuristic-Based Decomposition
inferred← citeshttps://doi.org/10.1017/s1471068419000061openalex-snapshot
The Seventh Answer Set Programming Competition: Design and Results
inferred← citeshttps://doi.org/10.1017/s1471068419000073openalex-snapshot
A Logic Framework for P2P Deductive Databases
inferred← citeshttps://doi.org/10.1017/s1471068421000545openalex-snapshot
Strong Equivalence and Program Structure in Arguing Essential Equivalence between Logic Programs
inferred← citeshttps://doi.org/10.1017/s1471068421000582openalex-snapshot
Declarative Approaches to Counterfactual Explanations for Classification
inferred← citeshttps://doi.org/10.1017/s1471068422000047openalex-snapshot
Aggregate Semantics for Propositional Answer Set Programs
inferred← citeshttps://doi.org/10.1017/s1471068424000103openalex-snapshot
Unit Testing in ASP Revisited: Language and Test-Driven Development Environment
inferred← citeshttps://doi.org/10.1017/s1471068425100124openalex-snapshot
Counting Answer Sets of Disjunctive Answer Set Programs
inferred← citeshttps://doi.org/10.1017/s1471068425100264openalex-snapshot
ASP-FZN: A Translation-Based Constraint Answer Set Solver
inferred← citeshttps://doi.org/10.1017/s1471068425100331openalex-snapshot
Splitting a Disjunctive Logic Program
inferred← citeshttps://doi.org/10.1023/a:1018990308362openalex-snapshot
Tabling for non‐monotonic programming
inferred← citeshttps://doi.org/10.1080/0952813x.2014.993505openalex-snapshot
Effectively solving NP-SPEC encodings by translation to ASP
inferred← citeshttps://doi.org/10.1080/11663081.2013.799318openalex-snapshot
Model-based recasting in answer-set programming
inferred← citeshttps://doi.org/10.1093/logcom/exac001openalex-snapshot
Semantic data management in P2P systems driven by self-esteem
inferred← citeshttps://doi.org/10.1109/69.877512openalex-snapshot
Enhancing Disjunctive Datalog by constraints
inferred← citeshttps://doi.org/10.1109/ictai.2011.154openalex-snapshot
A New Tree-Decomposition Based Algorithm for Answer Set Programming
inferred← citeshttps://doi.org/10.1142/s0218213020600039openalex-snapshot
Logical Encoding of Argumentation Frameworks with Higher-order Attacks and Evidential Supports
inferred← citeshttps://doi.org/10.1145/1149114.1149115openalex-snapshot
Logic program-based updates
inferred← citeshttps://doi.org/10.1145/1149114.1149117openalex-snapshot
The DLV system for knowledge representation and reasoning
inferred← citeshttps://doi.org/10.1145/1243996.1244000openalex-snapshot
Semantical characterizations and complexity of equivalences in answer set programming
inferred← citeshttps://doi.org/10.1145/1297658.1297665openalex-snapshot
Outlier detection by logic programming
inferred← citeshttps://doi.org/10.1145/1342991.1342993openalex-snapshot
Coordination in answer set programming
inferred← citeshttps://doi.org/10.1145/153850.153863openalex-snapshot
Negation and minimality in non-horn databases
inferred← citeshttps://doi.org/10.1145/261124.261126openalex-snapshot
Disjunctive datalog
inferred← citeshttps://doi.org/10.1145/2818646openalex-snapshot
Backdoors to Normality for Disjunctive Logic Programs
inferred← citeshttps://doi.org/10.1145/3039244openalex-snapshot
Expressiveness of Logic Programs under the General Stable Model Semantics
inferred← citeshttps://doi.org/10.1145/3151759.3151768openalex-snapshot
P2P deductive databases
inferred← citeshttps://doi.org/10.1145/3568955openalex-snapshot
Witnesses for Answer Sets of Logic Programs
inferred← citeshttps://doi.org/10.1145/502807.502810openalex-snapshot
Complexity and expressive power of logic programming
inferred← citeshttps://doi.org/10.1527/tjsai.24.405openalex-snapshot
Verification of Legal Knowledge-base with Conflictive Concept
inferred← citeshttps://doi.org/10.1609/aaai.v24i1.7592openalex-snapshot
Space Efficient Evaluation of ASP Programs with Bounded Predicate Arities
inferred← citeshttps://doi.org/10.1609/aaai.v24i1.7595openalex-snapshot
Ordered Completion for First-Order Logic Programs on Finite Structures
inferred← citeshttps://doi.org/10.1609/aaai.v27i1.8624openalex-snapshot
Backdoors to Normality for Disjunctive Logic Programs
inferred← citeshttps://doi.org/10.1609/aaai.v29i1.9397openalex-snapshot
On Elementary Loops and Proper Loops for Disjunctive Logic Programs
inferred← citeshttps://doi.org/10.1609/aaai.v30i1.10096openalex-snapshot
Boolean Functions with Ordered Domains in Answer Set Programming
inferred← citeshttps://doi.org/10.1609/aaai.v35i7.16784openalex-snapshot
Treewidth-Aware Complexity in ASP: Not all Positive Cycles are Equally Hard
inferred← citeshttps://doi.org/10.1609/aaai.v36i5.20518openalex-snapshot
ApproxASP – a Scalable Approximate Answer Set Counter
inferred← citeshttps://doi.org/10.1609/aaai.v37i5.25788openalex-snapshot
Characterizing Structural Hardness of Logic Programs: What Makes Cycles and Reachability Hard for Treewidth?
inferred← citeshttps://doi.org/10.1609/aaai.v38i9.28923openalex-snapshot
On the Structural Hardness of Answer Set Programming: Can Structure Efficiently Confine the Power of Disjunctions?
inferred← citeshttps://doi.org/10.1609/aimag.v18i3.1304openalex-snapshot
Logic and Databases Past, Present, and Future
inferred← citeshttps://doi.org/10.1613/jair.1.14091openalex-snapshot
Domain-Specific Heuristics in Answer Set Programming: A Declarative Non-Monotonic Approach
inferred← citeshttps://doi.org/10.1613/jair.223openalex-snapshot
A Hierarchy of Tractable Subsets for Computing Stable Models
inferred← citeshttps://doi.org/10.1613/jair.5373openalex-snapshot
The Sixth Answer Set Programming Competition
inferred← citeshttps://doi.org/10.1613/jair.664openalex-snapshot
Space Efficiency of Propositional Knowledge Representation Formalisms
inferred← citeshttps://doi.org/10.22029/jlupub-7003openalex-snapshot
Preferred answer sets for extended logic programs
inferred← citeshttps://doi.org/10.22215/etd/2007-06172openalex-snapshot
Optimizing and implementing repair programs for consistent query answering in databases
inferred← citeshttps://doi.org/10.22215/etd/2007-06200openalex-snapshot
Handling inconsistency in databases and data integration systems
inferred← citeshttps://doi.org/10.22215/etd/2017-12066openalex-snapshot
Declarative Entity Resolution Via Matching Dependencies and Combining Matching Dependencies With Machine Learning for Entity Resolution
inferred← citeshttps://doi.org/10.24963/ijcai.2017/40openalex-snapshot
Constraint-Based Symmetry Detection in General Game Playing
inferred← citeshttps://doi.org/10.24963/kr.2020/49openalex-snapshot
Treewidth-aware Reductions of Normal ASP to SAT - Is Normal ASP Harder than SAT after All?
inferred← citeshttps://doi.org/10.24963/kr.2021/41openalex-snapshot
Unfounded Sets for Disjunctive Hybrid MKNF Knowledge Bases
inferred← citeshttps://doi.org/10.25932/publishup-41246openalex-snapshot
Detecting Inconsistencies in Large Biological Networks with Answer Set Programming
inferred← citeshttps://doi.org/10.25932/publishup-41309openalex-snapshot
On Elementary Loops of Logic Programs
inferred← citeshttps://doi.org/10.29007/rjb2openalex-snapshot
Syntactic Conditions for Antichain Property in Consistency Restoring Prolog
inferred← citeshttps://doi.org/10.3166/jancl.16.35-86openalex-snapshot
Some (in)translatability results for normal logic programs and propositional theories
inferred← citeshttps://doi.org/10.3233/978-1-61499-419-0-1139openalex-snapshot
From Disjunctive to Normal Logic Programs via Unfolding and Shifting
inferred← citeshttps://doi.org/10.3233/aac-220019openalex-snapshot
Assumption-based argumentation for extended disjunctive logic programming and its relation to nonmonotonic reasoning
inferred← citeshttps://doi.org/10.3233/aic-140591openalex-snapshot
Monotonic qualitative logic programs: Computation and applications
inferred← citeshttps://doi.org/10.3233/aic-2009-0445openalex-snapshot
Structure-based satisfiability checking
inferred← citeshttps://doi.org/10.3233/aic-2011-0495openalex-snapshot
Symmetry-breaking answer set solving
inferred← citeshttps://doi.org/10.3233/fi-1996-281205openalex-snapshot
Reducing Disjunctive to Non-Disjunctive Semantics by Shift-Operations
inferred← citeshttps://doi.org/10.3233/fi-2017-1585openalex-snapshot
Representing Argumentation Frameworks in Answer Set Programming
inferred← citeshttps://doi.org/10.3233/fun-2006-712-303openalex-snapshot
Pruning Operators for Disjunctive Logic Programming Systems
inferred← citeshttps://doi.org/10.3233/ia-170104openalex-snapshot
I-DLV: The new intelligent grounder of DLV
inferred← citeshttps://doi.org/10.3233/ia-240019openalex-snapshot
Design and implementation of modern CDCL ASP solvers
inferred← citeshttps://doi.org/10.3233/sw-140140openalex-snapshot
Defeasibility in answer set programs with defaults and argumentation rules
inferred← citeshttps://doi.org/10.34726/hss.2013.22347openalex-snapshot
Inconsistency management for traffic regulations
inferred← citeshttps://doi.org/10.4204/eptcs.325.25openalex-snapshot
LP2PB: Translating Answer Set Programs into Pseudo-Boolean Theories
inferred← citeshttps://doi.org/10.4204/eptcs.345.13openalex-snapshot
How to Split a Logic Program
inferred← citeshttps://doi.org/10.4204/eptcs.364.6openalex-snapshot
A Fixpoint Characterization of Three-Valued Disjunctive Hybrid MKNF Knowledge Bases
inferred← citeshttps://doi.org/10.4204/eptcs.416.34openalex-snapshot
Answer Set Counting and its Applications
inferred← citeshttps://doi.org/10.48550/arxiv.1008.5033openalex-snapshot
Symmetry Breaking for Answer Set Programming
showing the first 200 of 217 · page through all 217
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.