On the public citation graph

Optimization Methods for Logical Inference

https://doi.org/10.2307/254266
0 signed · 108 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 points at this work

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

inferred← citeshttps://doi.org/10.1002/9781118033036.ch19openalex-snapshot
Logic‐Based Benders Decomposition
inferred← citeshttps://doi.org/10.1002/9781118445112openalex-snapshot
Wiley StatsRef: Statistics Reference Online
inferred← citeshttps://doi.org/10.1007/0-387-32942-0_3openalex-snapshot
Logic-Based Modeling
inferred← citeshttps://doi.org/10.1007/0-387-34296-6_4openalex-snapshot
Discovering Rules That Govern Monotone Phenomena
inferred← citeshttps://doi.org/10.1007/0-387-34296-6_5openalex-snapshot
Learning Logic Formulas and Related Error Distributions
inferred← citeshttps://doi.org/10.1007/1-4020-0611-x_42openalex-snapshot
Artificial intelligence
inferred← citeshttps://doi.org/10.1007/10720084_1openalex-snapshot
Combining Logic and Optimization in Cutting Plane Theory
inferred← citeshttps://doi.org/10.1007/11425076_4openalex-snapshot
Convex Programming Methods for Global Optimization
inferred← citeshttps://doi.org/10.1007/3-540-36127-8_6openalex-snapshot
Towards Default Reasoning through MAX-SAT
inferred← citeshttps://doi.org/10.1007/3-540-45470-5_21openalex-snapshot
On Identifying Simple and Quantified Lattice Points in the 2SAT Polytope
inferred← citeshttps://doi.org/10.1007/3-540-46135-3_2openalex-snapshot
Integrating Constraint and Integer Programming for the Orthogonal Latin Squares Problem
inferred← citeshttps://doi.org/10.1007/978-1-4419-1644-0_4openalex-snapshot
Decomposition Techniques for Hybrid MILP/CP Models applied to Scheduling and Routing Problems
inferred← citeshttps://doi.org/10.1007/978-1-4419-6800-5_1openalex-snapshot
Complete and Exact Peptide Sequence Analysis Based on Propositional Logic
inferred← citeshttps://doi.org/10.1007/978-1-4613-0459-3_1openalex-snapshot
A
inferred← citeshttps://doi.org/10.1007/978-3-319-06932-6_19openalex-snapshot
Extraction of Rules Dependencies for Optimization of Backward Inference Algorithm
inferred← citeshttps://doi.org/10.1007/978-3-319-15835-8_35openalex-snapshot
Use of Automated Image Analysis in the Study of Mechanisms of the Formation of Nitrided Layers
inferred← citeshttps://doi.org/10.1007/978-3-540-24605-3_18openalex-snapshot
Solving Error Correction for Large Data Sets by Means of a SAT Solver
inferred← citeshttps://doi.org/10.1007/978-3-540-25984-8_26openalex-snapshot
Analyzing Selected Quantified Integer Programs
inferred← citeshttps://doi.org/10.1007/978-3-540-30502-6_24openalex-snapshot
Minimal Unsatisfiable Sets: Classification and Bounds
inferred← citeshttps://doi.org/10.1007/978-3-540-45193-8_12openalex-snapshot
Constraint-Based Optimization with the Minimax Decision Criterion
inferred← citeshttps://doi.org/10.1007/978-3-642-25661-5_27openalex-snapshot
A Polynomial-Time Algorithm for the Planar Quantified Integer Programming Problem
inferred← citeshttps://doi.org/10.1007/978-3-642-39091-3_13openalex-snapshot
Probabilistic Satisfiability and Coherence Checking through Integer Programming
inferred← citeshttps://doi.org/10.1007/978-3-642-46773-8_4openalex-snapshot
Mathematical Programming Methods for Reasoning under Uncertainty
inferred← citeshttps://doi.org/10.1007/978-3-642-78545-0_22openalex-snapshot
Künstliche Intelligenz und Operations Research
inferred← citeshttps://doi.org/10.1007/s00224-004-1220-0openalex-snapshot
Tractable Fragments of Presburger Arithmetic
inferred← citeshttps://doi.org/10.1007/s10107-003-0375-9openalex-snapshot
Logic-based Benders decomposition
inferred← citeshttps://doi.org/10.1007/s10107-003-0420-8openalex-snapshot
A polyhedral study of the cardinality constrained knapsack problem
inferred← citeshttps://doi.org/10.1007/s10288-011-0191-7openalex-snapshot
Learning from conflicts in propositional satisfiability
inferred← citeshttps://doi.org/10.1007/s10472-004-9418-zopenalex-snapshot
On Exact Selection of Minimally Unsatisfiable Subformulae
inferred← citeshttps://doi.org/10.1007/s10472-005-9000-3openalex-snapshot
New tractable classes for default reasoning from conditional knowledge bases
inferred← citeshttps://doi.org/10.1007/s10472-006-9041-2openalex-snapshot
An explicit semidefinite characterization of satisfiability for Tseitin instances on toroidal grid graphs
inferred← citeshttps://doi.org/10.1007/s10472-007-9085-yopenalex-snapshot
On a decision procedure for quantified linear programs
inferred← citeshttps://doi.org/10.1007/s10472-021-09762-2openalex-snapshot
Parameterized and exact algorithms for finding a read-once resolution refutation in 2CNF formulas
inferred← citeshttps://doi.org/10.1007/s10479-015-2028-9openalex-snapshot
What we can learn from conflicts in propositional satisfiability
inferred← citeshttps://doi.org/10.1007/s10852-010-9136-yopenalex-snapshot
A Logic-Based Approach to Polymer Sequence Analysis
inferred← citeshttps://doi.org/10.1007/s11334-008-0045-4openalex-snapshot
Approximate verification in an open source world
inferred← citeshttps://doi.org/10.1007/s13160-017-0284-6openalex-snapshot
Autark assignments of Horn CNFs
inferred← citeshttps://doi.org/10.1016/b978-044450813-3/50014-xopenalex-snapshot
Solving Numerical Constraints
inferred← citeshttps://doi.org/10.1016/j.artint.2006.02.003openalex-snapshot
Constraint-based optimization and utility elicitation using the minimax decision criterion
inferred← citeshttps://doi.org/10.1016/j.camwa.2006.12.094openalex-snapshot
Solving peptide sequencing as satisfiability
inferred← citeshttps://doi.org/10.1016/j.compchemeng.2003.11.006openalex-snapshot
Part II. Future perspective on optimization
inferred← citeshttps://doi.org/10.1016/j.dam.2016.09.008openalex-snapshot
On semidefinite least squares and minimal unsatisfiability
inferred← citeshttps://doi.org/10.1016/j.disopt.2006.10.012openalex-snapshot
New updating criteria for conflict-based branching heuristics in DPLL algorithms for satisfiability
inferred← citeshttps://doi.org/10.1016/j.ejor.2005.01.048openalex-snapshot
Searching for Mutually Orthogonal Latin Squares via integer and constraint programming
inferred← citeshttps://doi.org/10.1016/j.ejor.2011.03.048openalex-snapshot
Compact bidding languages and supplier selection for markets with economies of scale and scope
inferred← citeshttps://doi.org/10.1016/j.entcs.2017.04.004openalex-snapshot
Generalized Probabilistic Satisfiability
inferred← citeshttps://doi.org/10.1016/j.ifacol.2021.11.288openalex-snapshot
Model Predictive Control of Discrete-Continuous Energy Systems via Generalized Disjunctive Programming
inferred← citeshttps://doi.org/10.1016/j.ijar.2006.07.014openalex-snapshot
A probabilistic logic based on the acceptability of gambles
inferred← citeshttps://doi.org/10.1016/j.ijar.2014.09.002openalex-snapshot
Probabilistic satisfiability and coherence checking through integer programming
inferred← citeshttps://doi.org/10.1016/j.infsof.2014.01.012openalex-snapshot
Efficient synthesis of feature models
inferred← citeshttps://doi.org/10.1016/j.ins.2014.04.057openalex-snapshot
Prominent classes of the most general subsumptive solutions of Boolean equations
inferred← citeshttps://doi.org/10.1016/j.tcs.2019.02.021openalex-snapshot
Generalized probabilistic satisfiability and applications to modelling attackers with side-channel capabilities
inferred← citeshttps://doi.org/10.1016/s0166-218x(01)00344-4openalex-snapshot
Ideal clutters
inferred← citeshttps://doi.org/10.1016/s0166-218x(02)00385-2openalex-snapshot
A complete adaptive algorithm for propositional satisfiability
inferred← citeshttps://doi.org/10.1016/s0166-218x(02)00399-2openalex-snapshot
Approximating minimal unsatisfiable subformulae by means of adaptive core search
inferred← citeshttps://doi.org/10.1016/s0305-0548(02)00127-2openalex-snapshot
A strategic model for supply chain design with logical constraints: formulation and solution
inferred← citeshttps://doi.org/10.1016/s0377-2217(01)00246-6openalex-snapshot
Construction of rule-based assignment models
inferred← citeshttps://doi.org/10.1016/s0377-2217(02)00073-5openalex-snapshot
Formulating logical implications in combinatorial optimisation
inferred← citeshttps://doi.org/10.1016/s0377-2217(97)00179-3openalex-snapshot
On consistency in probabilistic logic for logical formulas represented by B-hypertrees
inferred← citeshttps://doi.org/10.1016/s1571-0653(04)00320-8openalex-snapshot
Restoring Satisfiability or Maintaining Unsatisfiability by finding small Unsatisfiable Subformulae
inferred← citeshttps://doi.org/10.1017/9781139061759openalex-snapshot
Predictive Control for Linear and Hybrid Systems
inferred← citeshttps://doi.org/10.1017/cbo9780511780448.008openalex-snapshot
Optimization Methods in Logic
inferred← citeshttps://doi.org/10.1023/a:1012332915908openalex-snapshot
Easy Cases of Probabilistic Satisfiability
inferred← citeshttps://doi.org/10.1023/a:1015854101244openalex-snapshot
Partial Instantiation Methods for Inference in First-Order Logic
inferred← citeshttps://doi.org/10.1023/a:1018935718357openalex-snapshot
A prospective on mathematics and artificial intelligence: Problem solving=Modeling+Theorem proving
inferred← citeshttps://doi.org/10.1023/a:1020521718123openalex-snapshot
Mathematical Programming Embeddings of Logic
inferred← citeshttps://doi.org/10.1080/00207170600726592openalex-snapshot
Parametric optimization and optimal control using algebraic geometry methods
inferred← citeshttps://doi.org/10.1080/0740817x.2010.504691openalex-snapshot
Rule-based forecasting and production control system design utilizing a feedback control architecture
inferred← citeshttps://doi.org/10.1080/10556780512331318281openalex-snapshot
Error correction for massive datasets
inferred← citeshttps://doi.org/10.1093/logcom/exs034openalex-snapshot
Polynomial time certifying algorithms for the planar quantified integer programming problem
inferred← citeshttps://doi.org/10.1103/physrevlett.120.256101openalex-snapshot
Rich Ground-State Chemical Ordering in Nanoparticles: Exact Solution of a Model for Ag-Au Clusters
inferred← citeshttps://doi.org/10.1109/splc.2008.49openalex-snapshot
Sample Spaces and Feature Models: There and Back Again
inferred← citeshttps://doi.org/10.1109/tac.2010.2089563openalex-snapshot
On Tractable Instances of Modular Supervisory Control
inferred← citeshttps://doi.org/10.1109/tcst.2004.824309openalex-snapshot
HYSDEL—A Tool for Generating Computational Hybrid Models for Analysis and Synthesis Problems
inferred← citeshttps://doi.org/10.1134/s1990478913020142openalex-snapshot
The pricing problem. Part I: Exact and approximate algorithms
inferred← citeshttps://doi.org/10.1137/1.9780898717105openalex-snapshot
Combinatorial Optimization
inferred← citeshttps://doi.org/10.1142/9789814277327_0010openalex-snapshot
Tutorials on Agent-based Modelling with NetLogo and Network Analysis with Pajek
inferred← citeshttps://doi.org/10.1145/1047788.1047833openalex-snapshot
Modelling legal reasoning in a mathematical environment through model theoretic semantics
inferred← citeshttps://doi.org/10.1145/2362536.2362553openalex-snapshot
Efficient synthesis of feature models
inferred← citeshttps://doi.org/10.1145/775832.776041openalex-snapshot
A fast pseudo-boolean constraint solver
inferred← citeshttps://doi.org/10.1155/2009/845804openalex-snapshot
On the Complexities of Selected Satisfiability and Equivalence Queries over Boolean Formulas and Inclusion Queries over Hulls
inferred← citeshttps://doi.org/10.11606/t.3.2011.tde-17082011-090935openalex-snapshot
Lógicas probabilísticas com relações de independência: representação de conhecimento e aprendizado de máquina.
inferred← citeshttps://doi.org/10.1186/s13173-015-0028-xopenalex-snapshot
Generalized probabilistic satisfiability through integer programming
inferred← citeshttps://doi.org/10.1287/ijoc.13.4.258.9733openalex-snapshot
Algorithms for Hybrid MILP/CP Models for a Class of Optimization Problems
inferred← citeshttps://doi.org/10.1287/ijoc.14.1.20.7709openalex-snapshot
A MINSAT Approach for Learning in Logic Domains
inferred← citeshttps://doi.org/10.1287/ijoc.14.4.295.2828openalex-snapshot
Logic, Optimization, and Constraint Programming
inferred← citeshttps://doi.org/10.1613/jair.1698openalex-snapshot
Optiplan: Unifying IP-based and Graph-based Planning
inferred← citeshttps://doi.org/10.1613/jair.5658openalex-snapshot
Linear Satisfiability Preserving Assignments
inferred← citeshttps://doi.org/10.21936/si2012_v33.n2a.160openalex-snapshot
Wybrane aspekty wnioskowania w systemach z wiedzą niepełną
inferred← citeshttps://doi.org/10.21936/si2013_v34.n2a.32openalex-snapshot
Metoda współczynników niepełności wiedzy w systemach wspomagania decyzji
inferred← citeshttps://doi.org/10.24963/ijcai.2023/632openalex-snapshot
Approximate Inference in Logical Credal Networks
inferred← citeshttps://doi.org/10.29007/s21nopenalex-snapshot
Decidable Inequalities over Infinite Trees
inferred← citeshttps://doi.org/10.31390/gradschool_dissertations.1678openalex-snapshot
Data mining and knowledge discovery: a guided approach base on monotone boolean functions
inferred← citeshttps://doi.org/10.3233/sat190001openalex-snapshot
Semidefinite Optimization Approaches for Satisfiability and Maximum-Satisfiability Problems
inferred← citeshttps://doi.org/10.3233/sat190036openalex-snapshot
An Extended Semidefinite Relaxation for Satisfiability
inferred← citeshttps://doi.org/10.3233/sat190060openalex-snapshot
Linear Satisfiability Algorithm for 3CNF Formulas of Certain Signaling Networks
inferred← citeshttps://doi.org/10.3390/ma9040265openalex-snapshot
Heuristic Analysis Model of Nitrided Layers’ Formation Consisting of the Image Processing and Analysis and Elements of Artificial Intelligence
inferred← citeshttps://doi.org/10.3844/jmssp.2008.186.193openalex-snapshot
Powerful Features of the Modern Syllogistic Method of Propositional Logic
inferred← citeshttps://doi.org/10.4197/eng.27-1.2openalex-snapshot
Finding All Solutions of the Boolean Satisfiability Problem, If Any, via Boolean Equation Solving
inferred← citeshttps://doi.org/10.4197/eng.28-1.1openalex-snapshot
Satisfiability in Big Boolean Algebras via Boolean-Equation Solving
inferred← citeshttps://doi.org/10.48550/arxiv.1205.2644openalex-snapshot
First-Order Mixed Integer Linear Programming
inferred← citeshttps://doi.org/10.48550/arxiv.1806.09818openalex-snapshot
Linear Tree Constraints
inferred← citeshttps://doi.org/10.48550/arxiv.1910.13975openalex-snapshot
A Brief Tour of Logic and Optimization
inferred← citeshttps://doi.org/10.48550/arxiv.2109.12240openalex-snapshot
Logical Credal Networks
inferred← citeshttps://doi.org/10.5282/edoc.24526openalex-snapshot
Decidability of linear tree constraints for resource analysis of object-oriented programs
inferred← citeshttps://doi.org/10.5555/777092.777150openalex-snapshot
Solving concisely expressed combinatorial auction problems
inferred← citeshttps://doi.org/10.5860/choice.39-4018openalex-snapshot
Combinatorial optimization: packing and covering
inferred← citeshttps://doi.org/10.7282/t31v5h04openalex-snapshot
Valid inequalities for mixed-integer linear programming 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.