Clingo
Loading...
Searching...
No Matches
solver.hh
1#pragma once
2
3#include <clingo/control/config.hh>
4#include <clingo/control/grounder.hh>
5
6#include <clingo/output/backend.hh>
7
8#include <potassco/basic_types.h>
9
10#include <clasp/clasp_facade.h>
11#include <clasp/cli/clasp_options.h>
12
13namespace CppClingo::Control {
14
17
18class Solver;
19
24 public:
26 void main(Solver &slv) { do_main(slv); }
28 void exec(std::string_view code) { do_exec(code); }
29
30 private:
31 virtual void do_exec(std::string_view code) = 0;
32 virtual void do_main(Solver &slv) = 0;
33};
35using UScript = std::unique_ptr<Script>;
36
42 public:
44 void register_script(std::string_view name, UScript script);
46 void main(Solver &slv);
47
48 private:
49 void do_exec(Location const &loc, Logger &log, std::string_view name, std::string_view code) override;
50 auto do_callable(std::string_view name, size_t args) -> bool override;
51 void do_call(Location const &loc, std::string_view name, SymbolSpan args, SymbolVec &out) override;
52
53 std::vector<std::pair<std::string, UScript>> scripts_;
54};
55
57enum class IStop : uint8_t {
58 none,
59 sat,
60 unsat,
61 unknown
62};
63
65enum class AppMode : uint8_t {
66 parse,
67 rewrite,
68 ground,
69 solve
70};
71
73enum class BackendType : uint8_t {
74 clasp,
75 aspif,
76 smodels,
77 reify
78};
79
81enum class ReifyFlags : uint8_t {
82 reify_scc = 1U,
83 reify_step = 2U
84};
87
97 size_t imin = 0;
99 std::optional<size_t> imax = std::nullopt;
103 std::string iquery = "query";
105 bool single_shot = false;
106};
107
109enum class SymbolSelectFlags : uint8_t {
110 none = 0,
111 shown = 1,
112 atoms = 2,
113 terms = 4,
114 theory = 8,
115 all = 15,
116};
119
121enum class ModelType : uint8_t {
122 model = 0,
125};
126
128enum class ConsequenceType : uint8_t {
129 false_ = 0,
130 true_ = 1,
131 unknown = 2
132};
133
136 public:
139
148 template <class F> auto add(Symbol sym, F &&fun) -> prg_id_t {
149 auto [it, ins] = map_.emplace(sym, 0);
150 if (ins) {
151 it.value() = std::invoke(std::forward<F>(fun));
152 }
153 return it.value();
154 }
155
162 void add(Symbol sym, prg_id_t id) {
163 if (!map_.emplace(sym, id).second) {
164 throw std::runtime_error("collision of term ids");
165 }
166 }
167
172 [[nodiscard]] auto term_id(size_t i) const -> prg_id_t {
173 if (i < size()) {
174 return map_.nth(i).value();
175 }
176 throw std::range_error{"index out of range"};
177 }
178
183 [[nodiscard]] auto symbol(size_t i) const -> Symbol {
184 if (i < size()) {
185 return *map_.nth(i).key();
186 }
187 throw std::range_error{"index out of range"};
188 }
189
197 [[nodiscard]] auto index(Symbol sym) const -> size_t { return map_.find(sym) - map_.begin(); }
198
202 [[nodiscard]] auto size() const -> size_t { return map_.size(); }
203
208 [[nodiscard]] auto begin() const -> Map::const_iterator { return map_.cbegin(); }
209
214 [[nodiscard]] auto end() const -> Map::const_iterator { return map_.cend(); }
215
216 private:
218};
219
221class BaseView {
222 public:
224 virtual ~BaseView() = default;
226 [[nodiscard]] auto bases() const -> Ground::Bases const & { return do_bases(); }
228 [[nodiscard]] auto term_base() const -> TermBaseMap const & { return do_term_base(); }
230 [[nodiscard]] auto clasp_program() const -> Clasp::Asp::LogicProgram const & { return do_clasp_program(); }
232 [[nodiscard]] auto clasp_theory() const -> Potassco::TheoryData const & { return clasp_program().theoryData(); }
233
234 private:
235 [[nodiscard]] virtual auto do_bases() const -> Ground::Bases const & = 0;
236 [[nodiscard]] virtual auto do_term_base() const -> TermBaseMap const & = 0;
237 [[nodiscard]] virtual auto do_clasp_program() const -> Clasp::Asp::LogicProgram const & = 0;
238};
239
241class SolveControl : public BaseView {
242 public:
244 void add_clause(PrgLitSpan lits) { do_add_clause(lits); }
245
246 private:
247 virtual void do_add_clause(PrgLitSpan lits) = 0;
248};
249
251class Model {
252 public:
253 virtual ~Model() = default;
254
259 void symbols(SymbolSelectFlags type, SymbolVec &res) const { do_symbols(type, res); }
263 [[nodiscard]] auto number() const -> uint64_t { return do_number(); }
267 [[nodiscard]] auto type() const -> ModelType { return do_type(); }
272 [[nodiscard]] auto contains(Symbol sym) const -> bool { return do_contains(sym); }
277 [[nodiscard]] auto is_true(prg_lit_t lit) const -> bool { return do_is_true(lit); }
282 [[nodiscard]] auto is_consequence(prg_lit_t lit) const -> ConsequenceType { return do_is_consequence(lit); }
286 [[nodiscard]] auto costs() const -> std::span<prg_sum_t const> { return do_costs(); }
290 [[nodiscard]] auto priorities() const -> std::span<prg_weight_t const> { return do_priorities(); }
294 [[nodiscard]] auto optimality_proven() const -> bool { return do_optimality_proven(); }
298 [[nodiscard]] auto thread_id() const -> prg_id_t { return do_thread_id(); }
302 [[nodiscard]] auto context() -> SolveControl & { return do_control(); }
303
305 virtual void extend(SymbolSpan symbols) { do_extend(symbols); }
306
307 private:
308 virtual void do_symbols(SymbolSelectFlags type, SymbolVec &res) const = 0;
309 [[nodiscard]] virtual auto do_number() const -> uint64_t = 0;
310 [[nodiscard]] virtual auto do_type() const -> ModelType = 0;
311 [[nodiscard]] virtual auto do_contains(Symbol sym) const -> bool = 0;
312 virtual void do_extend(SymbolSpan symbols) = 0;
313 [[nodiscard]] virtual auto do_is_true(prg_lit_t lit) const -> bool = 0;
314 [[nodiscard]] virtual auto do_is_consequence(prg_lit_t lit) const -> ConsequenceType = 0;
315 [[nodiscard]] virtual auto do_costs() const -> std::span<prg_sum_t const> = 0;
316 [[nodiscard]] virtual auto do_priorities() const -> std::span<prg_weight_t const> = 0;
317 [[nodiscard]] virtual auto do_optimality_proven() const -> bool = 0;
318 [[nodiscard]] virtual auto do_thread_id() const -> prg_id_t = 0;
319 [[nodiscard]] virtual auto do_control() -> SolveControl & = 0;
320};
322using UModel = std::unique_ptr<Model>;
323
328enum class SolveResult : uint8_t {
329 empty = 0,
330 satisfiable = 1,
331 unsatisfiable = 2,
332 exhausted = 4,
333 interrupted = 8,
334};
337
340 public:
342 virtual ~SolveHandle() = default;
343
349 auto get() -> SolveResult { return do_get(); }
353 void cancel() { do_cancel(); }
359 void resume() { do_resume(); }
369 auto model() -> Model const * { return do_model(); }
375 auto last() -> Model const * { return do_last(); }
382 auto core() -> PrgLitSpan { return do_core(); }
392 auto wait(double timeout) -> bool { return do_wait(timeout); }
393
394 private:
395 virtual auto do_get() -> SolveResult = 0;
396 virtual void do_cancel() = 0;
397 virtual void do_resume() = 0;
398 virtual auto do_model() -> Model const * = 0;
399 virtual auto do_last() -> Model const * = 0;
400 virtual auto do_core() -> PrgLitSpan = 0;
401 virtual auto do_wait(double timeout) -> bool = 0;
402};
404using USolveHandle = std::unique_ptr<SolveHandle>;
405
408 public:
409 virtual ~SolveEventHandler() = default;
410
417 auto on_model(Model &mdl) -> bool { return do_on_model(mdl); }
425 void on_stats(Potassco::AbstractStatistics &stats) { do_on_stats(stats); }
432 void on_unsat(Clasp::SumView bound) { do_on_unsat(bound); }
437 void on_core(Potassco::LitSpan core) { do_on_core(core); }
444 void on_finish(SolveResult result) { do_on_finish(result); }
445
446 private:
447 virtual auto do_on_model([[maybe_unused]] Model &mdl) -> bool { return true; }
448 virtual void do_on_stats([[maybe_unused]] Potassco::AbstractStatistics &stats) {}
449 virtual void do_on_unsat([[maybe_unused]] Clasp::SumView bound) {}
450 virtual void do_on_core([[maybe_unused]] Potassco::LitSpan core) {}
451 virtual void do_on_finish([[maybe_unused]] SolveResult result) {}
452};
454using USolveEventHandler = std::unique_ptr<SolveEventHandler>;
455
459enum class SolveMode : uint8_t {
460 none = 0,
461 async = 1,
462 yield = 2,
463};
466
480 public:
484 [[nodiscard]] auto program() -> Clasp::Asp::LogicProgram & { return do_program(); }
488 [[nodiscard]] auto theory() -> Output::TheoryData & { return do_theory(); }
492 [[nodiscard]] auto store() -> SymbolStore & { return do_store(); }
499 [[nodiscard]] auto add_atom(Symbol atom) -> prg_lit_t { return do_add_atom(atom); }
504 void close() { do_close(); }
506 virtual ~BackendHandle() = default;
507
508 private:
509 virtual auto do_program() -> Clasp::Asp::LogicProgram & = 0;
510 virtual auto do_theory() -> Output::TheoryData & = 0;
511 virtual auto do_store() -> SymbolStore & = 0;
512 virtual auto do_add_atom(Symbol atom) -> prg_lit_t = 0;
513 virtual void do_close() = 0;
514};
516using UBackendHandle = std::unique_ptr<BackendHandle>;
517
519class Propagator : public Potassco::AbstractPropagator, public Potassco::AbstractHeuristic {
520 public:
522 [[nodiscard]] virtual auto hasHeuristic() const -> bool = 0;
523};
525using UPropagator = std::unique_ptr<Propagator>;
526
532 public:
534 void lock() {
535 if (mut_) {
536 mut_->lock();
537 }
538 }
540 void unlock() {
541 if (mut_) {
542 mut_->unlock();
543 }
544 }
546 void enable(bool state) {
547 if (!state) {
548 mut_.reset();
549 } else if (!mut_) {
550 mut_.emplace();
551 mut_->lock();
552 }
553 }
554
555 private:
556 std::optional<std::mutex> mut_;
557};
558
560template <class M> class unlock_guard {
561 public:
563 explicit unlock_guard(M &mut) : mut_{&mut} { mut_->unlock(); }
565 unlock_guard(const unlock_guard &) = delete;
566 ~unlock_guard() { mut_->lock(); }
567 auto operator=(const unlock_guard &) -> unlock_guard & = delete;
568
569 private:
570 M *mut_;
571};
572
575 public:
577 void init(CppClingo::Control::BaseView &view, std::ostream &out);
581 void end_step();
583 auto out() -> std::ostream & { return *out_; }
584
585 private:
586 struct State {
587 State() = default;
588 size_t atom : 1 = 0;
589 size_t term : 1 = 0;
590 size_t index : (8 * sizeof(size_t)) - 2 = 0;
591 };
592
593 auto output(CppClingo::Symbol const &sym) -> State &;
594
595 CppClingo::Control::BaseView *view_ = nullptr;
596 std::ostream *out_ = nullptr;
597 size_t ids_ = 0;
598 std::vector<size_t> buf_;
600};
602using USymbolTable = std::unique_ptr<SymbolTable>;
603
605// TODO: Simplify/Move on next output refactoring
606class Grounded : public Clasp::Event {
607 public:
609 explicit Grounded(Input::ProgramParamVec const &params)
610 : Event(this, subsystem_load, verbosity_quiet), params(params) {}
612 std::span<Input::ProgramParamVec::value_type const> params;
613};
614
615class Grounder;
616
622 public:
629 void finish(GroundResult result) noexcept { do_finish(result); }
630
631 private:
632 virtual void do_finish([[maybe_unused]] GroundResult result) noexcept {}
633};
634
636using UGroundEventHandler = std::unique_ptr<GroundEventHandler>;
637
642 public:
649 ~GroundHandle() noexcept;
650
652 GroundHandle(GroundHandle const &other) = delete;
654 GroundHandle(GroundHandle &&other) noexcept;
656 auto operator=(GroundHandle &&other) noexcept -> GroundHandle &;
658 auto operator=(GroundHandle const &other) -> GroundHandle & = delete;
659
670 [[nodiscard]] auto wait(double timeout) -> bool;
675 [[nodiscard]] auto get() -> GroundResult;
679 void cancel();
680
681 private:
682 class Impl;
683 std::unique_ptr<Impl> impl_;
684};
685
689class Solver : public BaseView {
690 public:
692 Solver(Clasp::ClaspFacade &clasp, Clasp::Cli::ClaspCliConfig &config, Logger &log, SymbolStore &store,
693 Scripts &scripts, Input::RewriteOptions ropts, SolverOptions sopts, FILE *out = stdout);
694
696 void main(std::span<std::string_view const> const &files);
698 void main();
699
708 void parse(std::string_view str);
710 void parse(std::span<std::string_view const> const &files);
712 void parse_with(std::function<void(ProgramBackend *, TheoryBackend *)> cb);
713
715 void add_const(String name, Symbol value);
717 [[nodiscard]] auto const_map() -> Input::ConstMap const &;
719 [[nodiscard]] auto start_ground(ProgramParamVec params, UGroundEventHandler handler) -> GroundHandle;
721 auto ground(ProgramParamVec const &params, Ground::ScriptCallback *ctx, Util::StopFlag *stop = nullptr)
722 -> GroundResult;
729 auto solve(USolveEventHandler handler = {}, PrgLitSpan assumptions = {}, SolveMode mode = SolveMode::none)
730 -> USolveHandle;
731
733 void output_unprocessed_program(std::ostream &out);
734
736 void output_program(std::ostream &out);
737
739 auto map_model(Clasp::Model const &mdl) -> Model &;
740
745 [[nodiscard]] auto buf() -> Util::OutputBuffer & { return stream_.buffer(); };
746
748 [[nodiscard]] auto stream() -> Util::OutputStream & { return stream_; };
749
754 [[nodiscard]] auto backend() -> UBackendHandle;
755
757 [[nodiscard]] auto clasp_facade() -> Clasp::ClaspFacade & { return *clasp_; }
758
760 [[nodiscard]] auto clasp_facade() const -> Clasp::ClaspFacade const & { return *clasp_; }
761
763 [[nodiscard]] auto config() -> ClingoConfig & { return config_; }
764
766 [[nodiscard]] auto clasp_stats() -> Potassco::AbstractStatistics const & {
767 auto const *stats = clasp_->getStats();
768 return stats != nullptr ? *stats : throw std::runtime_error("not in solving mode");
769 }
770
775
777 auto get_lock() -> CallbackLock & { return lock_; }
778
780 void block_main(bool block) { block_main_ = block; }
781
783 [[nodiscard]] auto get_mode() const -> AppMode { return opts_.mode; }
784
786 auto user_data() -> void *& { return data_; }
787
789 void interrupt() noexcept;
790
792 [[nodiscard]] auto get_parts() -> std::optional<Input::StmParts> const & { return grd_.get_parts(); }
793
795 void set_parts(std::optional<Input::StmParts> parts) { grd_.set_parts(std::move(parts)); }
798 auto pos = Position{*grd_.store().string("<cmd>"), 1, 1};
799 auto loc = Location{pos, pos};
800 grd_.set_parts(std::make_optional<Input::StmParts>(loc, Input::Precedence::override_, std::move(parts)));
801 }
802
804 void show(Input::SharedSig const &sig) { grd_.show(sig); }
805
807 auto sym_tab() -> SymbolTable & {
808 if (!sym_tab_) {
809 sym_tab_ = std::make_unique<SymbolTable>();
810 }
811 return *sym_tab_;
812 }
813
817 auto print_summary(bool final) { grd_.print_summary(final); }
818
820 void accept(Ground::ProfileNode::Visitor const &visit) const { grd_.accept(visit); }
821
822 private:
823 class AspifBackend;
824
832 enum class State : uint8_t {
833 initial, //< initial step
834 grounded, //< step has been grounded
835 prepared, //< step is prepared for solving
836 solved, //< step has been solved
837 };
838
848 auto make_output_(SymbolStore &store, AppMode mode, BackendType backend_type, ReifyFlags reify_flags) -> UOutputStm;
849
851 void prepare_();
852
854 void simplify_();
855
857 void enable_updates_();
858
859 [[nodiscard]] auto do_bases() const -> Ground::Bases const & override { return grd_.base(); }
860
861 [[nodiscard]] auto do_term_base() const -> TermBaseMap const & override { return terms_; }
862
863 [[nodiscard]] auto do_clasp_program() const -> Clasp::Asp::LogicProgram const & override {
864 return clasp_->asp() != nullptr ? *clasp_->asp() : throw std::runtime_error("not in solving mode");
865 }
866
867 void incmode_();
868
869 CallbackLock lock_;
870 std::vector<UPropagator> propagators_;
871 TermBaseMap terms_;
872 Clasp::ClaspFacade *clasp_;
873 ClingoConfig config_;
874 Util::OutputStream stream_;
875 UProgramBackend backend_;
876 std::unique_ptr<Output::TheoryData> theory_;
877 std::unique_ptr<Potassco::AbstractProgram> output_program_;
878 std::unique_ptr<Potassco::AbstractProgram> program_;
879 UOutputStm out_;
880 UModel mdl_;
881 USymbolTable sym_tab_;
882 Grounder grd_;
883 Scripts *scripts_;
884 State state_ = State::initial;
885 SolverOptions opts_;
886 BuiltinIncludes includes_ = BuiltinIncludes::empty;
887 void *data_ = nullptr;
888 bool block_main_ = false;
889};
890
892
893} // namespace CppClingo::Control
Object to provide access to the backend.
Definition solver.hh:479
auto store() -> SymbolStore &
The symbol store.
Definition solver.hh:492
auto theory() -> Output::TheoryData &
Get the theory.
Definition solver.hh:488
void close()
Close the handle.
Definition solver.hh:504
auto program() -> Clasp::Asp::LogicProgram &
Get the logic program.
Definition solver.hh:484
virtual ~BackendHandle()=default
Destroy the handle.
auto add_atom(Symbol atom) -> prg_lit_t
Add a literal for the given symbol.
Definition solver.hh:499
Interface providing the necessary data to inspect atom, term, and theory bases.
Definition solver.hh:221
auto clasp_theory() const -> Potassco::TheoryData const &
Get a reference to the underlying facade.
Definition solver.hh:232
virtual ~BaseView()=default
The default destructor.
auto bases() const -> Ground::Bases const &
Get a reference to the underlying atom bases.
Definition solver.hh:226
auto term_base() const -> TermBaseMap const &
Get a reference to the underlying term bases.
Definition solver.hh:228
auto clasp_program() const -> Clasp::Asp::LogicProgram const &
Get a reference to the underlying facade.
Definition solver.hh:230
This lock ensures that callbacks during solving are called in lock-step.
Definition solver.hh:531
void enable(bool state)
Enable or disable the lock.
Definition solver.hh:546
void unlock()
Release the lock.
Definition solver.hh:540
void lock()
Acquire the lock.
Definition solver.hh:534
This class provides a hierarchical configuration interface for clingo.
Definition config.hh:24
This callback interface provides grounding events.
Definition solver.hh:621
void finish(GroundResult result) noexcept
Callback to inform that the grounding has finished.
Definition solver.hh:629
A handle for asynchronous grounding.
Definition solver.hh:641
GroundHandle(Solver &solver, Input::ProgramParamVec params, UGroundEventHandler handler)
Start grounding with the given params and context.
~GroundHandle() noexcept
Destroy the ground handle.
Event emitted by a solver after the program is grounded.
Definition solver.hh:606
std::span< Input::ProgramParamVec::value_type const > params
The program parts that have been grounded.
Definition solver.hh:612
Grounded(Input::ProgramParamVec const &params)
Construct a grounded event.
Definition solver.hh:609
A grounder for logic programs.
Definition grounder.hh:18
The model class.
Definition solver.hh:251
auto contains(Symbol sym) const -> bool
Check if the model contains a (symbolic) atom.
Definition solver.hh:272
auto context() -> SolveControl &
Get the context object to control the search.
Definition solver.hh:302
auto is_true(prg_lit_t lit) const -> bool
Check if a program literal is true in a model.
Definition solver.hh:277
auto is_consequence(prg_lit_t lit) const -> ConsequenceType
Check whether the given literal is a consequence.
Definition solver.hh:282
auto number() const -> uint64_t
Get the running number of the model.
Definition solver.hh:263
auto optimality_proven() const -> bool
Check if the model corresponds to an optimal solution.
Definition solver.hh:294
auto thread_id() const -> prg_id_t
Get the solver/thread id the model was found in.
Definition solver.hh:298
auto type() const -> ModelType
Get the type of the model.
Definition solver.hh:267
auto priorities() const -> std::span< prg_weight_t const >
get the priorities of the costs.
Definition solver.hh:290
virtual void extend(SymbolSpan symbols)
Extend the model with the given symbols.
Definition solver.hh:305
void symbols(SymbolSelectFlags type, SymbolVec &res) const
Get the selected symbols in the model.
Definition solver.hh:259
auto costs() const -> std::span< prg_sum_t const >
Get the costs associated with a model.
Definition solver.hh:286
The propagator interface.
Definition solver.hh:519
virtual auto hasHeuristic() const -> bool=0
Can return false to not also register the propagator as a heuristic.
Script providing code execution, main, and callbacks.
Definition solver.hh:23
void main(Solver &slv)
Run the main function.
Definition solver.hh:26
void exec(std::string_view code)
Execute the given code.
Definition solver.hh:28
Helper to run specific code and callbacks.
Definition solver.hh:41
void register_script(std::string_view name, UScript script)
Register the given script.
void main(Solver &slv)
Run the main function.
Simple control class to add clauses while enumerating models.
Definition solver.hh:241
void add_clause(PrgLitSpan lits)
Add a clause over the given literal.
Definition solver.hh:244
The event handler interface.
Definition solver.hh:407
void on_unsat(Clasp::SumView bound)
Callback to intercept lower bounds.
Definition solver.hh:432
void on_finish(SolveResult result)
Callback to inform that the search has finished.
Definition solver.hh:444
auto on_model(Model &mdl) -> bool
Callback to intercept models.
Definition solver.hh:417
void on_core(Potassco::LitSpan core)
The unsatisfiable core of the current problem.
Definition solver.hh:437
void on_stats(Potassco::AbstractStatistics &stats)
Callback to update statistics.
Definition solver.hh:425
A handle to control a running search.
Definition solver.hh:339
auto last() -> Model const *
Get the last model after the search has finished.
Definition solver.hh:375
void resume()
Resume search after a model has been found to start search for the next one.
Definition solver.hh:359
auto wait(double timeout) -> bool
Wait for the given amount of time or until the next result is ready.
Definition solver.hh:392
auto get() -> SolveResult
Get the result of a search.
Definition solver.hh:349
auto model() -> Model const *
Get the current model or a nullptr if there is none.
Definition solver.hh:369
auto core() -> PrgLitSpan
Get a subset of the assumptions that made the problem unsatisfiable.
Definition solver.hh:382
virtual ~SolveHandle()=default
The default destructor.
void cancel()
Cancel the current search.
Definition solver.hh:353
A grounder and solver for logic programs.
Definition solver.hh:689
void parse(std::string_view str)
Parse a program from the given string.
void output_program(std::ostream &out)
Output the current program.
void join(Input::UnprocessedProgram const &prg)
Join with the given program.
void parse_with(std::function< void(ProgramBackend *, TheoryBackend *)> cb)
Parse with optional backends.
void set_parts(Input::ProgramParamVec parts)
Set the program parts to ground.
Definition solver.hh:797
void main(std::span< std::string_view const > const &files)
Parse, ground, and solve a program.
auto stream() -> Util::OutputStream &
Get the text buffer.
Definition solver.hh:748
auto clasp_facade() -> Clasp::ClaspFacade &
Get a pointer to the underlying clasp facade.
Definition solver.hh:757
void interrupt() noexcept
Interrupt the running (or next search).
void parse(std::span< std::string_view const > const &files)
Parse the given files.
auto backend() -> UBackendHandle
Get a handle that provides access to the backend to add atoms and rules.
void block_main(bool block)
Block execution of the main function in scripts.
Definition solver.hh:780
auto buf() -> Util::OutputBuffer &
Get the output buffer.
Definition solver.hh:745
void main()
Ground and solve a program.
auto const_map() -> Input::ConstMap const &
Get the const map.
auto print_summary(bool final)
Print per step summaries.
Definition solver.hh:817
void join_includes(BuiltinIncludes includes)
Enable the given includes.
auto ground(ProgramParamVec const &params, Ground::ScriptCallback *ctx, Util::StopFlag *stop=nullptr) -> GroundResult
Ground the program.
auto clasp_stats() -> Potassco::AbstractStatistics const &
Get the statistics.
Definition solver.hh:766
auto get_lock() -> CallbackLock &
Get the solvers callback lock.
Definition solver.hh:777
void accept(Ground::ProfileNode::Visitor const &visit) const
Accept a visitor for the profile nodes.
Definition solver.hh:820
void add_const(String name, Symbol value)
Define a constant.
auto sym_tab() -> SymbolTable &
Get the symbol table.
Definition solver.hh:807
Solver(Clasp::ClaspFacade &clasp, Clasp::Cli::ClaspCliConfig &config, Logger &log, SymbolStore &store, Scripts &scripts, Input::RewriteOptions ropts, SolverOptions sopts, FILE *out=stdout)
Create a solver object.
auto clasp_facade() const -> Clasp::ClaspFacade const &
Get a pointer to the underlying clasp facade.
Definition solver.hh:760
void set_parts(std::optional< Input::StmParts > parts)
Set the program parts to ground.
Definition solver.hh:795
void register_propagator(UPropagator propagator)
Register the given propagator with the control object.
auto map_model(Clasp::Model const &mdl) -> Model &
Map the given clasp model to the clingo one.
auto config() -> ClingoConfig &
Only non-null in solving mode.
Definition solver.hh:763
auto solve(USolveEventHandler handler={}, PrgLitSpan assumptions={}, SolveMode mode=SolveMode::none) -> USolveHandle
Solve the program.
void show(Input::SharedSig const &sig)
Show the given signature.
Definition solver.hh:804
void output_unprocessed_program(std::ostream &out)
Output the current unprocessed program.
auto start_ground(ProgramParamVec params, UGroundEventHandler handler) -> GroundHandle
Ground the program asynchronously.
auto user_data() -> void *&
Get user data for C integration.
Definition solver.hh:786
auto get_mode() const -> AppMode
Get the application mode.
Definition solver.hh:783
Helper to output symbols.
Definition solver.hh:574
void init(CppClingo::Control::BaseView &view, std::ostream &out)
Initialize the table before output.
void end_step()
Output atoms in extended aspif format.
auto out() -> std::ostream &
Get the underlying output stream.
Definition solver.hh:583
void begin_step()
Output ids of shown terms in extended aspif format.
Map from symbols to show term ids.
Definition solver.hh:135
auto size() const -> size_t
Get the number of mapped symbols.
Definition solver.hh:202
auto add(Symbol sym, F &&fun) -> prg_id_t
Add a new symbol to the map.
Definition solver.hh:148
auto end() const -> Map::const_iterator
Get an iterator over the symbol id pairs in the map pointing to the end of the sequence.
Definition solver.hh:214
void add(Symbol sym, prg_id_t id)
Add a symbol with the given id.
Definition solver.hh:162
auto index(Symbol sym) const -> size_t
Get the index of the symbol.
Definition solver.hh:197
auto term_id(size_t i) const -> prg_id_t
Get the id at the given index.
Definition solver.hh:172
auto begin() const -> Map::const_iterator
Get an iterator over the symbol id pairs in the map pointing to the beginning of the sequence.
Definition solver.hh:208
Util::ordered_map< SharedSymbol, prg_id_t > Map
The container storing the mapping (internal).
Definition solver.hh:138
auto symbol(size_t i) const -> Symbol
Get the symbol at the given index.
Definition solver.hh:183
RAII helper to unlock a mutex.
Definition solver.hh:560
unlock_guard(const unlock_guard &)=delete
Destructor re-locking the mutex.
unlock_guard(M &mut)
Constructor unlocking the mutex.
Definition solver.hh:563
std::function< void(std::variant< std::pair< std::string_view, bool >, std::pair< ProfileStats const *, ProfileType > >, size_t)> Visitor
The type of visitor function to use for visiting profile nodes.
Definition profile.hh:106
Interface to call functions during parsing/grounding.
Definition script.hh:28
void call(Location const &loc, std::string_view name, SymbolSpan args, SymbolVec &out)
Call the function with the given name and arguments.
Definition script.hh:35
Interface to execute code in source files.
Definition script.hh:12
Program grouping unprocessed statements.
Definition program.hh:70
The Location of an expression in an input source.
Definition location.hh:44
Simple logger to report message to stderr or via a callback.
Definition logger.hh:63
Class similar to Potassco::TheoryData but with automatic id generation.
Definition backend.hh:17
A point in an input source.
Definition location.hh:15
Abstract class connecting grounder and solver.
Definition backend.hh:54
Reference to a string stored in a symbol store.
Definition symbol.hh:18
A store for symbols.
Definition symbol.hh:454
Variant-like class to store symbols stored in a symbol store.
Definition symbol.hh:225
Abstract class connecting grounder and theory data.
Definition backend.hh:232
Create an output buffer that bears some similarities with C++'s iostreams.
Definition print.hh:26
Output stream with an underlying OutputBuffer.
Definition print.hh:202
Helper class to signal stopping of grounding.
Definition sync.hh:11
std::unique_ptr< Propagator > UPropagator
A unique pointer to a propagator.
Definition solver.hh:525
std::unique_ptr< SolveHandle > USolveHandle
A unique pointer for a solve handle.
Definition solver.hh:404
ModelType
Enumeration of available model flags.
Definition solver.hh:121
ReifyFlags
Enumeration of available options for the reification backend.
Definition solver.hh:81
IStop
Stop condition for incremental mode.
Definition solver.hh:57
SolveMode
The available solve modes.
Definition solver.hh:459
BuiltinIncludes
Bitset of enabled builtin includes.
Definition parse.hh:23
SymbolSelectFlags
A bit set of symbol selection flags.
Definition solver.hh:109
AppMode
Enumeration of available application modes.
Definition solver.hh:65
std::unique_ptr< SymbolTable > USymbolTable
A unique pointer to a symbol table.
Definition solver.hh:602
std::unique_ptr< SolveEventHandler > USolveEventHandler
A unique pointer for an event handler.
Definition solver.hh:454
SolveResult
The solve result.
Definition solver.hh:328
std::unique_ptr< Model > UModel
A unique pointer to a model.
Definition solver.hh:322
ConsequenceType
Enumeration of available consequence types.
Definition solver.hh:128
std::unique_ptr< BackendHandle > UBackendHandle
A unique pointer to a backend handle.
Definition solver.hh:516
BackendType
Enumeration of available output formats when in solving mode.
Definition solver.hh:73
std::unique_ptr< Script > UScript
A unique pointer to a script.
Definition solver.hh:35
std::unique_ptr< GroundEventHandler > UGroundEventHandler
A unique pointer to a ground event handler.
Definition solver.hh:636
@ cautious_consequences
The model represents a set of cautious consequences.
@ model
The model represents a stable model.
@ brave_consequences
The model represents a set of brave consequences.
@ reify_scc
Compute and print SCCs.
@ reify_step
Add step numbers.
@ none
Do not consider solve result.
@ sat
Stop when satisfiable.
@ unsat
Stop when unsat.
@ unknown
Stop when interrupted.
@ async
Solve asynchronously in background threads.
@ yield
Yield models while solving via SolveHandle::model().
@ shown
Select shown atoms and terms.
@ theory
Select symbols added by theory.
@ parse
Stop processing after parsing.
@ ground
Stop processing after grounding.
@ rewrite
Stop processing after rewriting.
@ solve
Stop processing after solving.
@ satisfiable
The search produced at least one model.
@ exhausted
The search has been exhausted.
@ true_
The literal is a consequence.
@ false_
The literal is not a consequence.
@ smodels
Print program in smodels format.
@ clasp
Standard solving mode: use the normal backend (Clasp)
@ aspif
Print program in ASP intermediate format.
@ reify
Print program as reified facts.
int32_t prg_lit_t
A program literal.
Definition backend.hh:27
std::unique_ptr< OutputStm > UOutputStm
Unique pointer for statement output.
Definition output.hh:253
std::span< prg_lit_t const > PrgLitSpan
A span of program literals.
Definition backend.hh:37
int32_t prg_weight_t
A weight used in weight and minimize constraints.
Definition backend.hh:33
int64_t prg_sum_t
Type to represent sums of weights.
Definition backend.hh:35
uint32_t prg_id_t
An id to refer to elements of a logic program.
Definition backend.hh:16
std::unique_ptr< ProgramBackend > UProgramBackend
A unique pointer for a program backend.
Definition backend.hh:229
std::span< Symbol const > SymbolSpan
A span of symbols.
Definition symbol.hh:218
std::vector< Symbol > SymbolVec
A vector of symbols.
Definition symbol.hh:220
GroundResult
Available grounding results.
Definition core.hh:187
@ unsatisfiable
The grounding was successful but an inconsistency was derived.
@ interrupted
The grounding was interrupted.
@ none
No sign.
Util::ordered_map< SharedString, std::pair< StmConst, SharedSymbol > > ConstMap
Map from identifiers to constants.
Definition program.hh:48
std::vector< ProgramParam > ProgramParamVec
A list of program params.
Definition statement.hh:764
std::tuple< SharedString, size_t, bool > SharedSig
The signature of a predicate.
Definition term.hh:42
tsl::ordered_map< Key, T, Hash, KeyEqual, Allocator, ValueTypeContainer, IndexType > ordered_map
Alias for ordered maps.
Definition ordered_map.hh:16
tsl::hopscotch_map< Key, T, Hash, KeyEqual, Allocator, NeighborhoodSize, StoreHash, GrowthPolicy > unordered_map
Alias for unordered maps.
Definition unordered_map.hh:17
#define CLINGO_ENABLE_BITSET_ENUM(E,...)
Opt-in macro for enabling bit operations for a given enum type.
Definition enum.hh:18
Options for the solver.
Definition solver.hh:89
std::string iquery
The name of the query atom.
Definition solver.hh:103
BackendType backend_type
Output format to use when in solving mode.
Definition solver.hh:93
size_t imin
The minimum number of incremental steps.
Definition solver.hh:97
bool single_shot
Restrict to single shot-solving.
Definition solver.hh:105
AppMode mode
Operation mode of the solver.
Definition solver.hh:91
std::optional< size_t > imax
The maximum number of incremental steps.
Definition solver.hh:99
ReifyFlags reify_flags
Reification flags.
Definition solver.hh:95
IStop istop
The stop condition for the incremental mode.
Definition solver.hh:101
Options to configure rewriting.
Definition program.hh:38