On the public citation graph

Pbmodels — Software to Compute Stable Models by Pseudoboolean Solvers

https://doi.org/10.1007/11546207_37
0 signed · 25 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-3-540-24605-3_37openalex-snapshot
An Extensible SAT-solver
inferredcites →https://doi.org/10.1007/978-3-540-45193-8_34openalex-snapshot
Local-Search Techniques for Propositional Logic Extended with Cardinality Constraints
inferredcites →https://doi.org/10.1007/b13743openalex-snapshot
Principles and practice of constraint programming - CP 2003 : 9th International Conference, CP 2003, Kinsale, Ireland, September 29 - October 3, 2003 : proceedings
inferredcites →https://doi.org/10.1016/s0004-3702(02)00187-xopenalex-snapshot
Extending and implementing the stable model semantics
inferredcites →https://doi.org/10.1108/ir.1999.04926fae.001openalex-snapshot
Lecture Notes in Computer Science 1205
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/978-3-540-74610-2_46openalex-snapshot
Modular Answer Set Programming
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-642-04238-6_18openalex-snapshot
A First Order Forward Chaining Approach for Answer Set Computing
inferred← citeshttps://doi.org/10.1007/s10472-009-9113-1openalex-snapshot
On the relation among answer set solvers
inferred← citeshttps://doi.org/10.1017/s147106840700302xopenalex-snapshot
Logic programs with monotone abstract constraint atoms
inferred← citeshttps://doi.org/10.1017/s1471068407003031openalex-snapshot
Automated Verification of Weak Equivalence within the smodels System
inferred← citeshttps://doi.org/10.1017/s1471068410000396openalex-snapshot
Testing and debugging techniques for answer set solver development
inferred← citeshttps://doi.org/10.1017/s1471068411000093openalex-snapshot
Reducing fuzzy answer set programming to model finding in fuzzy logics
inferred← citeshttps://doi.org/10.1017/s1471068416000569openalex-snapshot
ASPeRiX, a first-order forward chaining approach for answer set computing
inferred← citeshttps://doi.org/10.1609/aaai.v25i1.8055openalex-snapshot
Generating Explanations for Complex Biomedical Queries
inferred← citeshttps://doi.org/10.1613/jair.2009openalex-snapshot
Properties and Applications of Programs with Monotone and Convex Constraints
inferred← citeshttps://doi.org/10.1613/jair.2171openalex-snapshot
Answer Sets for Logic Programs with Arbitrary Abstract Constraint Atoms
inferred← citeshttps://doi.org/10.3233/fi-2010-311openalex-snapshot
Combinatorial Optimization Solutions for the Maximum Quartet Consistency Problem
inferred← citeshttps://doi.org/10.3233/ia-240019openalex-snapshot
Design and implementation of modern CDCL ASP solvers
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.2011.261openalex-snapshot
Extensions of Answer Set Programming
inferred← citeshttps://doi.org/10.48550/arxiv.1104.5133openalex-snapshot
Reducing Fuzzy Answer Set Programming to Model Finding in Fuzzy Logics
inferred← citeshttps://doi.org/10.48550/arxiv.1108.3281openalex-snapshot
Origins of Answer-Set Programming - Some Background And Two Personal Accounts
inferred← citeshttps://doi.org/10.48550/arxiv.1503.07717openalex-snapshot
ASPeRiX, a First Order Forward Chaining Approach for Answer Set Computing
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.