On the public citation graph

cmodels – SAT-Based Disjunctive Answer Set Solver

0 signed · 65 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-4615-1567-8_21openalex-snapshot
Extending the Smodels System with Cardinality and Weight Constraints
inferredcites →https://doi.org/10.1007/978-1-4684-3384-5_11openalex-snapshot
Negation as Failure
inferredcites →https://doi.org/10.1007/978-3-540-24599-5_31openalex-snapshot
Loop Formulas for Disjunctive Logic Programs
inferredcites →https://doi.org/10.1007/bf03037169openalex-snapshot
Classical negation in logic programs and disjunctive databases
inferredcites →https://doi.org/10.1016/s0004-3702(03)00078-xopenalex-snapshot
Enhancing disjunctive logic programming systems by SAT checkers
inferredcites →https://doi.org/10.1017/s1471068403001923openalex-snapshot
Weight constraints as nested expressions
inferredcites →https://doi.org/10.18725/oparu-319openalex-snapshot
19th Workshop on (Constraint) Logic Programming W(C)LP 2005
inferredcites →https://doi.org/10.48550/arxiv.cs/0303009openalex-snapshot
Unfolding Partiality and Disjunctions in Stable Model Semantics
inferredcites →https://doi.org/10.5555/777092.777113openalex-snapshot
ASSAT: computing answer sets of a logic program by SAT solvers

What points at this work

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

inferred← citeshttps://doi.org/10.1007/11546207_2openalex-snapshot
Data Integration and Answer Set Programming
inferred← citeshttps://doi.org/10.1007/11837787_4openalex-snapshot
Reasoning with Rules and Ontologies
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-319-03524-6_1openalex-snapshot
Comparing Alternative Solutions for Unfounded Set Propagation in ASP
inferred← citeshttps://doi.org/10.1007/978-3-319-03524-6_7openalex-snapshot
Automated Selection of Grounding Algorithm in Answer Set Programming
inferred← citeshttps://doi.org/10.1007/978-3-319-23264-5_16openalex-snapshot
Diagnosing Automatic Whitelisting for Dynamic Remarketing Ads Using Hybrid ASP
inferred← citeshttps://doi.org/10.1007/978-3-319-48758-8_36openalex-snapshot
Iteratively-Supported Formulas and Strongly Supported Models for Kleene Answer Set Programs
inferred← citeshttps://doi.org/10.1007/978-3-540-24609-1_5openalex-snapshot
Probabilistic Reasoning With Answer Sets
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-72200-7_14openalex-snapshot
Head-Elementary-Set-Free Logic Programs
inferred← citeshttps://doi.org/10.1007/978-3-540-74610-2_1openalex-snapshot
Towards Overcoming the Knowledge Acquisition Bottleneck in Answer Set Prolog Applications: Embracing Natural Language Inputs
inferred← citeshttps://doi.org/10.1007/978-3-540-75560-9_28openalex-snapshot
Integrating Inductive Definitions in SAT
inferred← citeshttps://doi.org/10.1007/978-3-540-79719-7_20openalex-snapshot
SAT(ID): Satisfiability of Propositional Logic Extended with Inductive Definitions
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-89982-2_19openalex-snapshot
Detecting Inconsistencies in Large Biological Networks with Answer Set Programming
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_45openalex-snapshot
nfn2dlp and nfnsolve: Normal Form Nested Programs Compiler and Solver
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-15675-5_33openalex-snapshot
DLV MC : Enhanced Model Checking in DLV
inferred← citeshttps://doi.org/10.1007/978-3-642-20832-4_27openalex-snapshot
ASP at Work: Spin-off and Applications of the DLV System
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-20895-9_14openalex-snapshot
Dynamic Magic Sets for Programs with Monotone Recursive Aggregates
inferred← citeshttps://doi.org/10.1007/978-3-642-20895-9_37openalex-snapshot
ASPIDE: Integrated Development Environment for Answer Set Programming
inferred← citeshttps://doi.org/10.1007/978-3-642-20895-9_46openalex-snapshot
The Third Answer Set Programming Competition: Preliminary Report of the System Competition Track
inferred← citeshttps://doi.org/10.1007/978-3-642-23300-5_10openalex-snapshot
Application of Answer Set Programming for Public Health Data Integration and Analysis
inferred← citeshttps://doi.org/10.1007/978-3-642-33353-8_39openalex-snapshot
The Multi-Engine ASP Solver me-asp
inferred← citeshttps://doi.org/10.1007/978-3-642-39784-4_4openalex-snapshot
Answer Set Programming
inferred← citeshttps://doi.org/10.1007/978-981-13-8311-3_4openalex-snapshot
Decision-Making Support Using Nonmonotonic Probabilistic Reasoning
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-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.1016/j.artint.2012.04.008openalex-snapshot
Magic Sets for disjunctive Datalog 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.12.001openalex-snapshot
Backdoors to tractable answer set programming
inferred← citeshttps://doi.org/10.1016/j.artint.2017.06.001openalex-snapshot
A progression semantics for first-order logic programs
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.ijar.2020.12.010openalex-snapshot
Rough set reasoning using answer set programs
inferred← citeshttps://doi.org/10.1017/s0269888909990270openalex-snapshot
Specifying and Analyzing Institutions in Multi-Agent Systems using Answer Set Programming
inferred← citeshttps://doi.org/10.1017/s147106840800358xopenalex-snapshot
Achieving compositionality of the stable model semantics for smodels programs
inferred← citeshttps://doi.org/10.1017/s1471068408003645openalex-snapshot
Probabilistic reasoning with answer sets
inferred← citeshttps://doi.org/10.1017/s147106840999010xopenalex-snapshot
Characterising equilibrium logic and nested logic programs: Reductions and complexity,
inferred← citeshttps://doi.org/10.1017/s1471068409990251openalex-snapshot
atalog: A logic language for expressing search and optimization problems
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/s1471068413000094openalex-snapshot
A multi-engine approach to answer-set programming
inferred← citeshttps://doi.org/10.1017/s1471068415000411openalex-snapshot
Disjunctive answer set solvers via templates
inferred← citeshttps://doi.org/10.1145/2818646openalex-snapshot
Backdoors to Normality for Disjunctive Logic Programs
inferred← citeshttps://doi.org/10.1177/29498732261419298openalex-snapshot
Towards End-to-End ASP Computation
inferred← citeshttps://doi.org/10.1613/jair.4175openalex-snapshot
Efficient HEX-Program Evaluation Based on Unfounded Sets
inferred← citeshttps://doi.org/10.25932/publishup-41309openalex-snapshot
On Elementary Loops of Logic Programs
inferred← citeshttps://doi.org/10.3233/978-1-61499-419-0-165openalex-snapshot
Abstract Disjunctive Answer Set Solvers
inferred← citeshttps://doi.org/10.3233/aic-2011-0492openalex-snapshot
Dynamic Magic Sets and super-coherent answer set programs
inferred← citeshttps://doi.org/10.4204/eptcs.325.25openalex-snapshot
LP2PB: Translating Answer Set Programs into Pseudo-Boolean Theories
inferred← citeshttps://doi.org/10.4230/lipics.iclp.2012.222openalex-snapshot
An FLP-Style Answer-Set Semantics for Abstract-Constraint Programs with Disjunctions
inferred← citeshttps://doi.org/10.48550/arxiv.0812.0659openalex-snapshot
Probabilistic reasoning with answer sets
inferred← citeshttps://doi.org/10.48550/arxiv.0911.2785openalex-snapshot
NP Datalog: a Logic Language for Expressing NP Search and Optimization Problems
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.