On the public citation graph

On computing minimal models

https://doi.org/10.1007/bf02136172
0 signed · 66 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-2001-2openalex-snapshot
Complexity of Computer Computations
inferredcites →https://doi.org/10.1007/978-1-4684-2001-2_9openalex-snapshot
Reducibility among Combinatorial Problems
inferredcites →https://doi.org/10.1007/bf00249353openalex-snapshot
Near-Horn Prolog and beyond
inferredcites →https://doi.org/10.1007/bf03037169openalex-snapshot
Classical negation in logic programs and disjunctive databases
inferredcites →https://doi.org/10.1007/bfb0000066openalex-snapshot
On indefinite databases and the closed world assumption
inferredcites →https://doi.org/10.1007/bfb0013613openalex-snapshot
The near-Horn approach to disjunctive logic programming
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(86)90032-9openalex-snapshot
Applications of circumscription to formalizing common-sense knowledge
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(87)90062-2openalex-snapshot
A theory of diagnosis from first principles
inferredcites →https://doi.org/10.1016/0004-3702(87)90063-4openalex-snapshot
Diagnosing multiple faults
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(92)90027-uopenalex-snapshot
Characterizing diagnoses and systems
inferredcites →https://doi.org/10.1016/0004-3702(94)00096-4openalex-snapshot
Structure-driven algorithms for truth maintenance
inferredcites →https://doi.org/10.1016/0020-0190(88)90113-5openalex-snapshot
Polynomially solvable satisfiability problems
inferredcites →https://doi.org/10.1016/0020-0190(92)90081-6openalex-snapshot
A hierarchy of tractable satisfiability problems
inferredcites →https://doi.org/10.1016/0167-6423(84)90013-3openalex-snapshot
The theory of relational databases
inferredcites →https://doi.org/10.1016/0743-1066(84)90014-1openalex-snapshot
Linear-time algorithms for testing the satisfiability of propositional horn formulae
inferredcites →https://doi.org/10.1016/0743-1066(87)90014-8openalex-snapshot
Unification as a complexity measure for logic programming
inferredcites →https://doi.org/10.1016/b978-1-4832-1452-8.50101-9openalex-snapshot
Reasoning with minimal models: Efficient algorithms and applications
inferredcites →https://doi.org/10.1137/0205048openalex-snapshot
On the Complexity of Timetable and Multicommodity Flow Problems
inferredcites →https://doi.org/10.1137/0213035openalex-snapshot
Simple Linear-Time Algorithms to Test Chordality of Graphs, Test Acyclicity of Hypergraphs, and Selectively Reduce Acyclic Hypergraphs
inferredcites →https://doi.org/10.1145/2402.322389openalex-snapshot
On the Desirability of Acyclic Database Schemes
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.

What points at this work

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

inferred← citeshttps://doi.org/10.1007/3-540-45402-0_24openalex-snapshot
Algorithms for Computing X-Minimal Models
inferred← citeshttps://doi.org/10.1007/3-540-48318-7_8openalex-snapshot
Evaluation of an Algorithm for the Transversal Hypergraph Problem
inferred← citeshttps://doi.org/10.1007/978-3-319-07046-9_26openalex-snapshot
A Portfolio Approach to Enumerating Minimal Correction Subsets for Satisfiability Problems
inferred← citeshttps://doi.org/10.1007/978-3-319-09284-3_25openalex-snapshot
Minimal-Model-Guided Approaches to Solving Polynomial Constraints and Extensions
inferred← citeshttps://doi.org/10.1007/978-3-319-10575-8_9openalex-snapshot
Propositional SAT Solving
inferred← citeshttps://doi.org/10.1007/978-3-319-24318-4_30openalex-snapshot
SAT-Based Horn Least Upper Bounds
inferred← citeshttps://doi.org/10.1007/978-3-319-40970-2_21openalex-snapshot
MCS Extraction with Sublinear Oracle Queries
inferred← citeshttps://doi.org/10.1007/978-3-319-66263-3_13openalex-snapshot
Introducing Pareto Minimal Correction Subsets
inferred← citeshttps://doi.org/10.1007/978-3-642-00768-2_33openalex-snapshot
All-Termination(T)
inferred← citeshttps://doi.org/10.1007/978-3-642-14888-0_28openalex-snapshot
Computing Minimal Models by Positively Minimal Disjuncts
inferred← citeshttps://doi.org/10.1007/978-3-642-39071-5_17openalex-snapshot
Minimizing Models for Tseitin-Encoded SAT Instances
inferred← citeshttps://doi.org/10.1007/s00355-023-01462-6openalex-snapshot
A general framework for participatory budgeting with additional constraints
inferred← citeshttps://doi.org/10.1016/0004-3702(94)00096-4openalex-snapshot
Structure-driven algorithms for truth maintenance
inferred← citeshttps://doi.org/10.1016/0304-3975(94)00216-9openalex-snapshot
Computing minimal models by partial instantiation
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.2014.02.003openalex-snapshot
On the tractability of minimal model computation for some CNF theories
inferred← citeshttps://doi.org/10.1016/j.artint.2017.07.005openalex-snapshot
Minimal sets on propositional formulae. Problems and reductions
inferred← citeshttps://doi.org/10.1016/j.artint.2022.103754openalex-snapshot
Graph-based construction of minimal models
inferred← citeshttps://doi.org/10.1016/j.micpro.2014.07.006openalex-snapshot
On don’t cares in test compression
inferred← citeshttps://doi.org/10.1016/j.pmcj.2013.07.013openalex-snapshot
Preserving quality of information by using semantic relationships
inferred← citeshttps://doi.org/10.1016/s0004-3702(00)00010-2openalex-snapshot
Semantical and computational aspects of Horn approximations
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/s0020-0190(00)00023-5openalex-snapshot
Generating all maximal models of a Boolean expression
inferred← citeshttps://doi.org/10.1017/s147106840200162xopenalex-snapshot
Learning in a compiler for MINSAT algorithms
inferred← citeshttps://doi.org/10.1017/s1471068407003158openalex-snapshot
Experimenting with recursive queries in database and logic programming systems
inferred← citeshttps://doi.org/10.1017/s1471068419000140openalex-snapshot
Beyond NP: Quantifying over Answer Sets
inferred← citeshttps://doi.org/10.1109/dsd.2013.56openalex-snapshot
Simulation and SAT Based ATPG for Compressed Test Generation
inferred← citeshttps://doi.org/10.1109/dsd.2014.86openalex-snapshot
PBO-Based Test Compression
inferred← citeshttps://doi.org/10.1109/tkde.2003.1245280openalex-snapshot
A logical framework for querying and repairing inconsistent databases
inferred← citeshttps://doi.org/10.1145/3340923openalex-snapshot
Incomplete SMT Techniques for Solving Non-Linear Formulas over the Integers
inferred← citeshttps://doi.org/10.1609/aaai.v28i1.8849openalex-snapshot
Relaxation Search: A Simple Way of Managing Optional Clauses
inferred← citeshttps://doi.org/10.1609/aaai.v34i03.5691openalex-snapshot
A Framework for Measuring Information Asymmetry
inferred← citeshttps://doi.org/10.24963/ijcai.2018/757openalex-snapshot
Multi-Objective Optimization Through Pareto Minimal Correction Subsets
inferred← citeshttps://doi.org/10.24963/kr.2020/71openalex-snapshot
Designing Participatory Budgeting Mechanisms Grounded in Judgment Aggregation
inferred← citeshttps://doi.org/10.29007/8btbopenalex-snapshot
Rotation Based MSS/MCS Enumeration
inferred← citeshttps://doi.org/10.3233/978-1-60750-606-5-15openalex-snapshot
On Computing Backbones of Propositional Theories
inferred← citeshttps://doi.org/10.48550/arxiv.1310.8120openalex-snapshot
On the Tractability of Minimal Model Computation for Some CNF Theories
inferred← citeshttps://doi.org/10.70675/8a8c1180zceedz4ab6z895fz48d59e9d97b1openalex-snapshot
Contributions aux approches par contraintes pour la fouille de données
inferred← citeshttps://doi.org/10.7155/jgaa.00107openalex-snapshot
An Efficient Algorithm for the Transversal Hypergraph Generation
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.