The following pages link to Miroslaw Truszczynski (Q286082):
Displayed 50 items.
- Covering the edges of a random graph by cliques (Q1906846) (← links)
- Cycle-saturated graphs of minimum size (Q1916094) (← links)
- Zero-sum problems -- a survey (Q1917486) (← links)
- Optimal packing of even circuits into a \(\text{DK}_ v\) (Q1918209) (← links)
- Decompositions of regular graphs into \(K^ c_ n \vee 2K_ 2\) (Q1923506) (← links)
- Complexity of computing with extended propositional logic programs (Q1924783) (← links)
- Permanents, Pfaffian orientations, and even directed circuits (Q1971908) (← links)
- Voting-based ensemble learning for partial lexicographic preference forests over combinatorial domains (Q2278102) (← links)
- New models for generating hard random Boolean formulas and disjunctive logic programs (Q2287195) (← links)
- New complexity results on aggregating lexicographic preference trees using positional scoring rules (Q2290373) (← links)
- Clique coverings of the edges of a random graph (Q2367438) (← links)
- Satisfiability testing of Boolean combinations of pseudo-Boolean constraints using local-search techniques (Q2385178) (← links)
- Strong and uniform equivalence of nonmonotonic theories -- an algebraic approach (Q2642629) (← links)
- Probabilistic lexicographic preference trees (Q2695429) (← links)
- (Q2734934) (← links)
- (Q2767095) (← links)
- Strong Equivalence of Qualitative Optimization Problems (Q2838231) (← links)
- On Equivalent Transformations of Infinitary Formulas under the Stable Model Semantics (Q2851269) (← links)
- On Optimal Solutions of Answer Set Optimization Problems (Q2851286) (← links)
- Aggregating Conditionally Lexicographic Preferences Using Answer Set Programming Solvers (Q2868558) (← links)
- Trichotomy and dichotomy results on the complexity of reasoning with disjunctive logic programs (Q2884255) (← links)
- Active integrity constraints and revision programming (Q2884257) (← links)
- Connecting First-Order ASP and the Logic FO(ID) through Reducts (Q2900547) (← links)
- The View-Update Problem for Indefinite Databases (Q2915065) (← links)
- A Measure of Arbitrariness in Abductive Explanations (Q2931272) (← links)
- Revisiting Epistemic Specifications (Q3001928) (← links)
- (Q3041242) (← links)
- Transition systems for model generators—A unifying approach (Q3087449) (← links)
- (Q3204489) (← links)
- (Q3220636) (← links)
- (Q3320433) (← links)
- Note on vertex degrees of planar graphs (Q3325769) (← links)
- (Q3334111) (← links)
- (Q3335022) (← links)
- (Q3339332) (← links)
- (Q3353055) (← links)
- (Q3446861) (← links)
- Reasoning with Preference Trees over Combinatorial Domains (Q3449520) (← links)
- Manipulation and Bribery When Aggregating Ranked Preferences (Q3449524) (← links)
- (Q3474672) (← links)
- (Q3486549) (← links)
- Declarative Semantics for Revision Programming and Connections to Active Integrity Constraints (Q3532460) (← links)
- Logic Programming for Knowledge Representation (Q3608647) (← links)
- Logic Programs with Abstract Constraint Atoms: The Role of Computations (Q3608661) (← links)
- Nonmonotonic Logics and Their Algebraic Foundations (Q3613329) (← links)
- Simple Random Logic Programs (Q3643121) (← links)
- Trichotomy Results on the Complexity of Reasoning with Disjunctive Logic Programs (Q3643127) (← links)
- Relativized hyperequivalence of logic programs for modular programming (Q3648358) (← links)
- (Q3710558) (← links)
- (Q3715137) (← links)