The following pages link to Tomi Janhunen (Q517385):
Displaying 50 items.
- Learning discrete decomposable graphical models via constraint optimization (Q517387) (← links)
- Evaluating the effect of semi-normality on the expressiveness of defaults (Q814438) (← links)
- On neighbourhood singleton-style consistencies for qualitative spatial and temporal reasoning (Q821556) (← links)
- On the intertranslatability of non-monotonic logics (Q1978031) (← links)
- On syntactic forgetting under uniform equivalence (Q2055801) (← links)
- The return of \textit{xorro} (Q2326736) (← links)
- Efficient computation of answer sets via SAT modulo acyclicity and vertex elimination (Q2694569) (← links)
- (Q2767110) (← links)
- Writing Declarative Specifications for Clauses (Q2835876) (← links)
- Normalizing Cardinality Rules Using Merging and Sorting Constructions (Q2851248) (← links)
- Sampler Programs: The Stable Model Semantics of Abstract Constraint Programs Revisited (Q2883081) (← links)
- Applying Visible Strong Equivalence in Answer-Set Program Transformations (Q2900532) (← links)
- SAT Modulo Graphs: Acyclicity (Q2938490) (← links)
- Improving the Normalization of Weight Rules in Answer Set Programs (Q2938492) (← links)
- On Testing Answer-Set Programs (Q2999229) (← links)
- Compact Translations of Non-disjunctive Answer Set Programs to Propositional Clauses (Q3001916) (← links)
- Strong Equivalence of Logic Programs with Abstract Constraint Atoms (Q3003252) (← links)
- (Q3089145) (← links)
- Declarative encodings of acyclicity properties (Q3304093) (← links)
- A Translation-based Approach to the Verification of Modular Equivalence (Q3395261) (← links)
- Answer Set Programming Modulo Acyclicity (Q3449199) (← links)
- ASP Solving for Expanding Universes (Q3449219) (← links)
- Implementing Prioritized Circumscription by Computing Disjunctive Stable Models (Q3534658) (← links)
- Achieving compositionality of the stable model semantics for <scp>smodels</scp> programs (Q3546042) (← links)
- Computing Stable Models via Reductions to Difference Logic (Q3643113) (← links)
- A Module-Based Framework for Multi-language Constraint Modeling (Q3643114) (← links)
- Some (in)translatability results for normal logic programs and propositional theories (Q3647255) (← links)
- Modularity Aspects of Disjunctive Stable Models (Q3651481) (← links)
- (Q4216774) (← links)
- (Q4246971) (← links)
- (Q4282608) (← links)
- (Q4536320) (← links)
- Answer Set Programming Modulo Acyclicity* (Q4589188) (← links)
- Clingo goes linear constraints over reals and integers (Q4592712) (← links)
- Optimizing phylogenetic supertrees using answer set programming (Q4593001) (← links)
- Stable-unstable semantics: Beyond NP with normal logic programs (Q4593043) (← links)
- (Q4708942) (← links)
- (Q4798001) (← links)
- (Q4955326) (← links)
- Boosting Answer Set Optimization with Weighted Comparator Networks (Q4957202) (← links)
- Applying Visible Strong Equivalence in Answer-Set Program Transformations (Q5034221) (← links)
- Cumulativity Tailored for Nonmonotonic Reasoning (Q5172609) (← links)
- Rewriting optimization statements in answer-set programs (Q5240209) (← links)
- Unfolding partiality and disjunctions in stable model semantics (Q5277741) (← links)
- (Q5282991) (← links)
- Logics in Artificial Intelligence (Q5394120) (← links)
- Logic Programming and Nonmonotonic Reasoning (Q5424873) (← links)
- Logic Programming and Nonmonotonic Reasoning (Q5424885) (← links)
- Logic Programming and Nonmonotonic Reasoning (Q5424886) (← links)
- Modularity Aspects of Disjunctive Stable Models (Q5425407) (← links)
