On the public citation graph
Towards an Integration of Answer Set and Constraint Solving
0 signed · 79 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.
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.
What this work says
Outgoing claims: the papers this work cites, builds on, or argues with.
inferredcites →https://doi.org/10.1007/3-540-45241-9_12openalex-snapshot
An A-Prolog Decision Support System for the Space Shuttle
inferredcites →https://doi.org/10.1007/3-540-45402-0_39openalex-snapshot
The USA-Advisor: A Case Study in Answer Set Planning
inferredcites →https://doi.org/10.1007/3-540-45402-0_8openalex-snapshot
On the Expressibility of Stable Logic Programming
inferredcites →https://doi.org/10.1007/3-540-63255-7_27openalex-snapshot
A deductive system for non-monotonic reasoning
inferredcites →https://doi.org/10.1007/978-3-540-24836-1_11openalex-snapshot
$\mathbb{ASP-PROLOG}$ : A System for Reasoning about Answer Set Programs in Prolog
inferredcites →https://doi.org/10.1007/978-3-642-60085-2_17openalex-snapshot
Stable Models and an Alternative Logic Programming Paradigm
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)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(92)90020-xopenalex-snapshot
A generic arc-consistency algorithm and its specializations
inferredcites →https://doi.org/10.1016/0743-1066(94)90033-7openalex-snapshot
Constraint logic programming: a survey
inferredcites →https://doi.org/10.1016/0743-1066(95)00121-2openalex-snapshot
Compiling constraints in clp(FD)
inferredcites →https://doi.org/10.1016/s0004-3702(02)00187-xopenalex-snapshot
Extending and implementing the stable model semantics
inferredcites →https://doi.org/10.1016/s0004-3702(96)00009-4openalex-snapshot
Is intractability of nonmonotonic reasoning a real drawback?
inferredcites →https://doi.org/10.1108/ir.1999.04926fae.001openalex-snapshot
Lecture Notes in Computer Science 1205
inferredcites →https://doi.org/10.1145/383779.383785openalex-snapshot
Verifying security protocols as planning in logic programming
inferredcites →https://doi.org/10.7551/mitpress/4298.003.0033openalex-snapshot
Experimenting with Nonmonotonic Reasoning
inferredcites →https://doi.org/10.7551/mitpress/4316.003.0014openalex-snapshot
Splitting a Logic Program
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_14openalex-snapshot
An Approximation of Action Theories of $\mathcal{AL}$ and Its Application to Conformant Planning
inferred← citeshttps://doi.org/10.1007/11799573_23openalex-snapshot
Using Answer Set Programming for the Automatic Compilation of Assessment Tests
inferred← citeshttps://doi.org/10.1007/11799573_28openalex-snapshot
Macros, Macro Calls and Use of Ensembles in Modular Answer Set Programming
inferred← citeshttps://doi.org/10.1007/3-540-45628-7_19openalex-snapshot
Constraint Logic Programming
inferred← citeshttps://doi.org/10.1007/978-3-030-19570-0_34openalex-snapshot
Lower Bound Founded Logic of Here-and-There
inferred← citeshttps://doi.org/10.1007/978-3-030-94479-7_1openalex-snapshot
People, Ideas, and the Path Ahead
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_10openalex-snapshot
Metric Temporal Answer Set Programming over Timed Traces
inferred← citeshttps://doi.org/10.1007/978-3-031-74209-5_2openalex-snapshot
Compiling Metric Temporal Answer Set Programming
inferred← citeshttps://doi.org/10.1007/978-3-540-72200-7_31openalex-snapshot
Enhancing ASP Systems for Planning with Temporal Constraints
inferred← citeshttps://doi.org/10.1007/978-3-540-78969-7_4openalex-snapshot
Integrating Answer Set Reasoning with Constraint Solving Techniques
inferred← citeshttps://doi.org/10.1007/978-3-540-89982-2_16openalex-snapshot
Here’s the Beef: Answer Set Programming !
inferred← citeshttps://doi.org/10.1007/978-3-642-02444-3_8openalex-snapshot
Towards a Type Discipline for Answer Set Programming
inferred← citeshttps://doi.org/10.1007/978-3-642-02846-5_22openalex-snapshot
Constraint Answer Set Solving
inferred← citeshttps://doi.org/10.1007/978-3-642-04238-6_15openalex-snapshot
A Module-Based Framework for Multi-language Constraint Modeling
inferred← citeshttps://doi.org/10.1007/978-3-642-14309-0_4openalex-snapshot
Constraint Logic Programming
inferred← citeshttps://doi.org/10.1007/978-3-642-20895-9_15openalex-snapshot
Strong Equivalence of Logic Programs with Abstract Constraint Atoms
inferred← citeshttps://doi.org/10.1007/978-3-642-20895-9_33openalex-snapshot
Industrial-Size Scheduling with ASP+CP
inferred← citeshttps://doi.org/10.1007/978-3-642-24364-6_18openalex-snapshot
A Semantic Account for Modularity in Multi-language Modelling of Search Problems
inferred← citeshttps://doi.org/10.1007/978-3-642-41524-1_12openalex-snapshot
Solving Modular Model Expansion: Case Studies
inferred← citeshttps://doi.org/10.1007/s10472-009-9116-yopenalex-snapshot
Integrating answer set programming and constraint logic programming
inferred← citeshttps://doi.org/10.1007/s10472-009-9118-9openalex-snapshot
Stable models and difference logic
inferred← citeshttps://doi.org/10.1016/j.artint.2010.04.007openalex-snapshot
Approximation of action theories and its application to conformant planning
inferred← citeshttps://doi.org/10.1016/j.artint.2013.10.004openalex-snapshot
Relating constraint answer set programming languages and algorithms
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.jal.2008.10.004openalex-snapshot
Executable specifications for hypothesis-based reasoning with Prolog and Constraint Handling Rules
inferred← citeshttps://doi.org/10.1016/s1574-6526(07)03020-9openalex-snapshot
Chapter 20 Knowledge Representation and Question Answering
inferred← citeshttps://doi.org/10.1017/s1471068409990093openalex-snapshot
The CIFF proof procedure for abductive logic programming with constraints: Theory, implementation and experiments
inferred← citeshttps://doi.org/10.1017/s1471068410000220openalex-snapshot
A translational approach to constraint answer set solving
inferred← citeshttps://doi.org/10.1017/s1471068412000142openalex-snapshot
ASP modulo CSP: The clingcon system
inferred← citeshttps://doi.org/10.1017/s147106841300032xopenalex-snapshot
Stable model semantics for founded bounds
inferred← citeshttps://doi.org/10.1017/s1471068417000138openalex-snapshot
Clingcon : The next generation
inferred← citeshttps://doi.org/10.1017/s1471068417000187openalex-snapshot
CASP solutions for planning in hybrid domains
inferred← citeshttps://doi.org/10.1017/s1471068418000133openalex-snapshot
Shared aggregate sets in answer set programming
inferred← citeshttps://doi.org/10.1017/s1471068418000558openalex-snapshot
The External Interface for Extending WASP
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/s1471068422000072openalex-snapshot
Answer Set Planning: A Survey
inferred← citeshttps://doi.org/10.1017/s1471068426100714openalex-snapshot
Implementing Metric Temporal Answer Set Programming
inferred← citeshttps://doi.org/10.1080/11663081.2023.2244365openalex-snapshot
Metric dynamic equilibrium logic
inferred← citeshttps://doi.org/10.1609/aaai.v26i1.8127openalex-snapshot
On the Relation of Constraint Answer Set Programming Languages and Algorithms
inferred← citeshttps://doi.org/10.1609/icaps.v31i1.15969openalex-snapshot
Translations from Discretised PDDL+ to Numeric Planning
inferred← citeshttps://doi.org/10.1613/jair.1.15986openalex-snapshot
Unifying SAT-Based Approaches to Maximum Satisfiability Solving
inferred← citeshttps://doi.org/10.2200/s00457ed1v01y201211aim019openalex-snapshot
Answer Set Solving in Practice
inferred← citeshttps://doi.org/10.2514/6.2005-7063openalex-snapshot
Application of Model-Based Technology Systems for Autonomous Systems
inferred← citeshttps://doi.org/10.3233/aic-2011-0491openalex-snapshot
Potassco: The Potsdam Answer Set Solving Collection
inferred← citeshttps://doi.org/10.4230/lipics.iclp.2010.255openalex-snapshot
Constraint Answer Set Programming Systems
inferred← citeshttps://doi.org/10.4230/lipics.iclp.2012.188openalex-snapshot
Answer Set Solving with Lazy Nogood Generation
inferred← citeshttps://doi.org/10.48550/arxiv.1007.4114openalex-snapshot
A Translational Approach to Constraint Answer Set Solving
inferred← citeshttps://doi.org/10.48550/arxiv.1008.5029openalex-snapshot
Reformulation of Global Constraints in Answer Set Programming
inferred← citeshttps://doi.org/10.48550/arxiv.1008.5033openalex-snapshot
Symmetry Breaking for Answer Set Programming
inferred← citeshttps://doi.org/10.48550/arxiv.1104.3927openalex-snapshot
Translation-based Constraint Answer Set Solving
inferred← citeshttps://doi.org/10.48550/arxiv.1109.0583openalex-snapshot
Solving Modular Model Expansion Tasks
inferred← citeshttps://doi.org/10.48550/arxiv.1210.2287openalex-snapshot
ASP modulo CSP: The clingcon system
inferred← citeshttps://doi.org/10.48550/arxiv.1503.07717openalex-snapshot
ASPeRiX, a First Order Forward Chaining Approach for Answer Set Computing
inferred← citeshttps://doi.org/10.48550/arxiv.1609.00030openalex-snapshot
PDDL+ Planning via Constraint Answer Set Programming
inferred← citeshttps://doi.org/10.48550/arxiv.1704.03574openalex-snapshot
CASP Solutions for Planning in Hybrid Domains
inferred← citeshttps://doi.org/10.5555/1788446.1788452openalex-snapshot
Integrating answer set reasoning with constraint solving techniques
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.