Miroslaw Truszczynski

From MaRDI portal
Revision as of 13:24, 10 December 2023 by AuthorDisambiguator (talk | contribs) (AuthorDisambiguator moved page Miroslaw Truszczynski to Miroslaw Truszczynski: Duplicate)
(diff) ← Older revision | Latest revision (diff) | Newer revision → (diff)

Person:286082

Available identifiers

zbMath Open truszczynski.miroslawDBLPt/MiroslawTruszczynskiWikidataQ102306774 ScholiaQ102306774MaRDI QIDQ286082

List of research outcomes





PublicationDate of PublicationType
Probabilistic lexicographic preference trees2023-03-31Paper
Skeptical rational extensions2022-08-30Paper
A logical framework for view updating in indefinite databases2022-06-09Paper
https://portal.mardi4nfdi.de/entity/Q50209692022-01-11Paper
https://portal.mardi4nfdi.de/entity/Q50205712022-01-06Paper
Maximin Share Allocations on Cycles2020-11-03Paper
Beyond NP: Quantifying over Answer Sets2020-05-04Paper
New complexity results on aggregating lexicographic preference trees using positional scoring rules2020-01-27Paper
New models for generating hard random Boolean formulas and disjunctive logic programs2020-01-20Paper
Preference Orders on Families of Sets - When Can Impossibility Results Be Avoided?2020-01-03Paper
Voting-based ensemble learning for partial lexicographic preference forests over combinatorial domains2019-12-09Paper
Infinitary default logic for specification of nonmonotonic reasoning2019-10-08Paper
Preference learning and optimization for partial lexicographic preference forests over combinatorial domains2018-06-26Paper
On equivalence of infinitary formulas under the stable model semantics2017-11-09Paper
Dual-normal logic programs – the forgotten class2017-11-09Paper
Predicate-calculus-based logics for modeling and solving search problems2017-07-12Paper
Fixed-parameter complexity of semantics for logic programs2017-06-13Paper
Packing analogue of \(k\)-radius sequences2016-06-20Paper
On abstract modular inference systems and solvers2016-05-19Paper
Reasoning with Preference Trees over Combinatorial Domains2015-11-04Paper
Manipulation and Bribery When Aggregating Ranked Preferences2015-11-04Paper
A Glimpse on Gerhard Brewka’s Contributions to Artificial Intelligence2015-02-04Paper
A Measure of Arbitrariness in Abductive Explanations2014-11-25Paper
A Tarskian Informal Semantics for Answer Set Programming2014-02-25Paper
Aggregating Conditionally Lexicographic Preferences Using Answer Set Programming Solvers2013-12-17Paper
On Equivalent Transformations of Infinitary Formulas under the Stable Model Semantics2013-10-10Paper
On Optimal Solutions of Answer Set Optimization Problems2013-10-10Paper
Strong Equivalence of Qualitative Optimization Problems2013-07-09Paper
https://portal.mardi4nfdi.de/entity/Q49068862013-02-28Paper
https://portal.mardi4nfdi.de/entity/Q49068902013-02-28Paper
Reducts of Propositional Theories, Satisfiability Relations, and Generalizations of Semantics of Logic Programs2012-11-13Paper
The View-Update Problem for Indefinite Databases2012-09-21Paper
Connecting First-Order ASP and the Logic FO(ID) through Reducts2012-07-23Paper
Trichotomy and dichotomy results on the complexity of reasoning with disjunctive logic programs2012-05-24Paper
Active integrity constraints and revision programming2012-05-24Paper
Constructions of asymptotically shortest \(k\)-radius sequences2012-02-11Paper
Transition systems for model generators—A unifying approach2011-08-16Paper
Revisiting Epistemic Specifications2011-05-19Paper
On graph equivalences preserved under extensions2011-05-16Paper
Reducts of propositional theories, satisfiability relations, and generalizations of semantics of logic programs2011-01-31Paper
Simple but Hard Mixed Horn Formulas2010-09-29Paper
Logic programs with abstract constraint atoms: the role of computations2010-05-07Paper
Principles and Practice of Constraint Programming – CP 20032010-03-02Paper
Relativized hyperequivalence of logic programs for modular programming2009-11-25Paper
Simple Random Logic Programs2009-11-10Paper
Trichotomy Results on the Complexity of Reasoning with Disjunctive Logic Programs2009-11-10Paper
Logic Programming2009-08-06Paper
Theory and Applications of Satisfiability Testing2009-07-24Paper
My six encounters with Victor Marek---a personal account2009-07-06Paper
Hyperequivalence of logic programs with respect to supported models2009-07-06Paper
Nonmonotonic Logics and Their Algebraic Foundations2009-03-12Paper
Logic Programming for Knowledge Representation2009-03-05Paper
Logic Programs with Abstract Constraint Atoms: The Role of Computations2009-03-05Paper
Approximation Schemes in Logic and Artificial Intelligence2009-01-27Paper
Declarative Semantics for Active Integrity Constraints2009-01-22Paper
Relativized Hyperequivalence of Logic Programs for Modular Programming2009-01-22Paper
Declarative Semantics for Revision Programming and Connections to Active Integrity Constraints2008-10-27Paper
On the number of minimal transversals in 3-uniform hypergraphs2008-07-11Paper
Logic programs with monotone abstract constraint atoms2008-03-27Paper
Logic Programming and Nonmonotonic Reasoning2007-11-07Paper
Logic Programming and Nonmonotonic Reasoning2007-11-07Paper
Logic Programming and Nonmonotonic Reasoning2007-11-07Paper
Satisfiability testing of Boolean combinations of pseudo-Boolean constraints using local-search techniques2007-10-11Paper
Strong and uniform equivalence of nonmonotonic theories -- an algebraic approach2007-08-17Paper
https://portal.mardi4nfdi.de/entity/Q34468612007-06-27Paper
Computing minimal models, stable models and answer sets2006-10-12Paper
Logic Programming and Nonmonotonic Reasoning2006-06-23Paper
Satisfiability and computing van der Waerden numbers2004-10-13Paper
Computing stable models: worst-case performance estimates2004-09-24Paper
https://portal.mardi4nfdi.de/entity/Q48129702004-08-12Paper
https://portal.mardi4nfdi.de/entity/Q47365132004-08-09Paper
Ultimate approximation and its application in nonmonotonic knowledge representation systems2004-08-06Paper
Computing large and small stable models2004-03-01Paper
On the problem of computing the well-founded semantics2004-03-01Paper
https://portal.mardi4nfdi.de/entity/Q47089452003-06-20Paper
https://portal.mardi4nfdi.de/entity/Q47089512003-06-20Paper
Default logic and specification of nonmonotonic reasoning2003-04-07Paper
https://portal.mardi4nfdi.de/entity/Q47980232003-03-18Paper
https://portal.mardi4nfdi.de/entity/Q47974242003-03-13Paper
Uniform semantic treatment of default and autoepistemic logics2003-01-22Paper
Computing with default logic2002-07-24Paper
Annotated revision programs2002-07-15Paper
https://portal.mardi4nfdi.de/entity/Q45374332002-06-30Paper
https://portal.mardi4nfdi.de/entity/Q27349342002-06-23Paper
https://portal.mardi4nfdi.de/entity/Q27670952002-04-28Paper
https://portal.mardi4nfdi.de/entity/Q47025772002-02-17Paper
https://portal.mardi4nfdi.de/entity/Q49553282000-05-25Paper
https://portal.mardi4nfdi.de/entity/Q49346462000-03-22Paper
https://portal.mardi4nfdi.de/entity/Q49396602000-02-06Paper
Extremal problems in logic programming and stable model computation1999-07-20Paper
Revision programming1998-06-30Paper
Representation theory for default logic1998-01-21Paper
A note on local colorings of graphs1997-08-14Paper
Modal logic for default reasoning1997-06-04Paper
https://portal.mardi4nfdi.de/entity/Q43324181997-06-03Paper
Complexity of computing with extended propositional logic programs1996-12-03Paper
Nonmonotonic reasoning is sometimes simpler!1996-11-04Paper
https://portal.mardi4nfdi.de/entity/Q42826171994-08-21Paper
Autoepistemic logic1994-08-21Paper
https://portal.mardi4nfdi.de/entity/Q42945821994-07-24Paper
Minimal knowledge problem: A new approach1994-07-04Paper
https://portal.mardi4nfdi.de/entity/Q42825551994-03-17Paper
Modal nonmonotonic logics1994-01-04Paper
https://portal.mardi4nfdi.de/entity/Q42739521993-12-08Paper
https://portal.mardi4nfdi.de/entity/Q42029241993-09-06Paper
https://portal.mardi4nfdi.de/entity/Q40287951993-03-28Paper
https://portal.mardi4nfdi.de/entity/Q40288131993-03-28Paper
https://portal.mardi4nfdi.de/entity/Q40222251993-01-17Paper
The Pure Logic of Necessitation1993-01-16Paper
Rado's Selection Principle: Applications to binary relations, graph and hypergraph colorings and partially ordered sets1992-12-06Paper
Indexing functions and time lower bounds for sorting on a mesh-connected computer1992-09-27Paper
Generalized local colorings of graphs1992-09-27Paper
https://portal.mardi4nfdi.de/entity/Q40122321992-09-27Paper
Decompositions of graphs into forests with bounded maximum degree1992-06-28Paper
Primal graphs with small degrees1992-06-25Paper
Asymptotic results on saturated graphs1992-06-25Paper
Decompositions of regular bipartite graphs1992-06-25Paper
https://portal.mardi4nfdi.de/entity/Q52029961991-01-01Paper
https://portal.mardi4nfdi.de/entity/Q34746721990-01-01Paper
https://portal.mardi4nfdi.de/entity/Q33530551989-01-01Paper
https://portal.mardi4nfdi.de/entity/Q34865491989-01-01Paper
https://portal.mardi4nfdi.de/entity/Q38265251989-01-01Paper
The tree number of a graph with a given girth1988-01-01Paper
https://portal.mardi4nfdi.de/entity/Q32044891988-01-01Paper
https://portal.mardi4nfdi.de/entity/Q38243201988-01-01Paper
https://portal.mardi4nfdi.de/entity/Q42038161988-01-01Paper
Linear upper bounds for local Ramsey numbers1987-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37588411986-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37895821986-01-01Paper
https://portal.mardi4nfdi.de/entity/Q38153431986-01-01Paper
Decomposition of large uniform hypergraphs1985-01-01Paper
Jump number problem: The role of matroids1985-01-01Paper
Note on the decomposition of \(\lambda K_{m,n}\) (\(\lambda K^*_{m,n}\)) into paths1985-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37105581985-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37151371985-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37187331985-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37416441985-01-01Paper
https://portal.mardi4nfdi.de/entity/Q37623461985-01-01Paper
https://portal.mardi4nfdi.de/entity/Q32206361984-01-01Paper
Note on vertex degrees of planar graphs1984-01-01Paper
https://portal.mardi4nfdi.de/entity/Q30412421983-01-01Paper
https://portal.mardi4nfdi.de/entity/Q33204331983-01-01Paper
https://portal.mardi4nfdi.de/entity/Q33341111983-01-01Paper
https://portal.mardi4nfdi.de/entity/Q33350221983-01-01Paper
https://portal.mardi4nfdi.de/entity/Q33393321983-01-01Paper
A simple algorithm for finding a cycle of length greater than three and without diagonals1981-01-01Paper
https://portal.mardi4nfdi.de/entity/Q38852111981-01-01Paper
https://portal.mardi4nfdi.de/entity/Q39222121981-01-01Paper
ON n-HAMILTONIAN GRAPHS OF MINIMAL SIZE1981-01-01Paper
Once more on storage for consecutive retrieval1980-01-01Paper
https://portal.mardi4nfdi.de/entity/Q38980431980-01-01Paper
https://portal.mardi4nfdi.de/entity/Q41626371978-01-01Paper

Research outcomes over time

This page was built for person: Miroslaw Truszczynski