On the public citation graph

On Solving Soft Temporal Constraints Using SAT Techniques

https://doi.org/10.1007/11564751_45
0 signed · 30 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.1002/9781118033036openalex-snapshot
Logic‐Based Methods for Optimization
inferredcites →https://doi.org/10.1007/11493853_24openalex-snapshot
A SAT-Based Decision Procedure for Mixed Logical/Integer Linear Problems
inferredcites →https://doi.org/10.1007/11527695_2openalex-snapshot
A SAT-Based Decision Procedure for the Boolean Combination of Difference Constraints
inferredcites →https://doi.org/10.1007/3-540-58601-6_92openalex-snapshot
Beyond finite domains
inferredcites →https://doi.org/10.1007/978-3-540-30201-8_31openalex-snapshot
Strategies for Global Optimization of Temporal Preferences
inferredcites →https://doi.org/10.1007/b100482openalex-snapshot
Principles and Practice of Constraint Programming – CP 2004
inferredcites →https://doi.org/10.1016/0004-3702(91)90006-6openalex-snapshot
Temporal constraint networks
inferredcites →https://doi.org/10.1016/s0004-3702(00)00019-9openalex-snapshot
Backtracking algorithms for disjunctions of temporal constraints
inferredcites →https://doi.org/10.1016/s0004-3702(03)00113-9openalex-snapshot
Efficient solution techniques for disjunctive temporal reasoning problems
inferredcites →https://doi.org/10.1016/s0004-3702(98)00031-9openalex-snapshot
A unifying approach to temporal constraint reasoning
inferredcites →https://doi.org/10.1016/s0004-3702(98)00068-xopenalex-snapshot
Remote Agent: to boldly go where no AI system has gone before
inferredcites →https://doi.org/10.1016/s0304-3975(00)00177-8openalex-snapshot
Tractable disjunctions of linear constraints: basic results and applications to temporal reasoning
inferredcites →https://doi.org/10.1016/s0921-8890(03)00077-0openalex-snapshot
Autominder: an intelligent cognitive orthotic system for people with memory impairment
inferredcites →https://doi.org/10.1023/b:aire.0000044479.89075.02openalex-snapshot
About the Authors
inferredcites →https://doi.org/10.1109/12.769433openalex-snapshot
GRASP: a search algorithm for propositional satisfiability
inferredcites →https://doi.org/10.1145/378239.379017openalex-snapshot
Chaff
inferredcites →https://doi.org/10.1184/r1/6707129openalex-snapshot
On Integrating Constraint Propagation and Linear Programming for Combinatorial Optimization
inferredcites →https://doi.org/10.5860/choice.38-3939openalex-snapshot
Logic-based methods for optimization: combining optimization and constraint satisfaction

What points at this work

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

inferred← citeshttps://doi.org/10.1007/11814948_1openalex-snapshot
From Propositional Satisfiability to Satisfiability Modulo Theories
inferred← citeshttps://doi.org/10.1007/11814948_18openalex-snapshot
On SAT Modulo Theories and Optimization Problems
inferred← citeshttps://doi.org/10.1007/978-3-319-03524-6_38openalex-snapshot
A Reduction-Based Approach for Solving Disjunctive Temporal Problems with Preferences
inferred← citeshttps://doi.org/10.1007/978-3-319-25032-8_11openalex-snapshot
Scheduling with Structured Preferences
inferred← citeshttps://doi.org/10.1007/978-3-642-00431-5_9openalex-snapshot
Experimental Evaluation of a Planning Language Suitable for Formal Verification
inferred← citeshttps://doi.org/10.1007/s10601-018-9293-6openalex-snapshot
Translation-based approaches for solving disjunctive temporal problems with preferences
inferred← citeshttps://doi.org/10.1016/j.artint.2010.11.016openalex-snapshot
On the modelling and optimization of preferences in constraint-based temporal reasoning
inferred← citeshttps://doi.org/10.1080/13875860801930407openalex-snapshot
Managing Temporal Constraints with Preferences
inferred← citeshttps://doi.org/10.1109/time.2006.10openalex-snapshot
Conditional and Composite Temporal Constraints with Preferences
inferred← citeshttps://doi.org/10.1145/1160633.1160934openalex-snapshot
Deploying a personalized time management agent
inferred← citeshttps://doi.org/10.1609/aaai.v26i1.8359openalex-snapshot
Evaluating Temporal Plans in Incomplete Domains
inferred← citeshttps://doi.org/10.3233/aic-2012-0527openalex-snapshot
Solving disjunctive temporal problems with preferences using maximum satisfiability
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.