The following pages link to Miroslaw Truszczynski (Q286082):
Displaying 50 items.
- On abstract modular inference systems and solvers (Q286083) (← links)
- Packing analogue of \(k\)-radius sequences (Q298335) (← links)
- (Q536220) (redirect page) (← links)
- On graph equivalences preserved under extensions (Q536221) (← links)
- (Q580351) (redirect page) (← links)
- The tree number of a graph with a given girth (Q580352) (← links)
- Ultimate approximation and its application in nonmonotonic knowledge representation systems (Q598245) (← links)
- Reducts of propositional theories, satisfiability relations, and generalizations of semantics of logic programs (Q622117) (← links)
- Constructions of asymptotically shortest \(k\)-radius sequences (Q662039) (← links)
- On the complexity of learning strings and sequences (Q688167) (← links)
- (Q762499) (redirect page) (← links)
- Decomposition of large uniform hypergraphs (Q762500) (← links)
- On the number of minimal transversals in 3-uniform hypergraphs (Q932689) (← links)
- Logic programs with abstract constraint atoms: the role of computations (Q969538) (← links)
- My six encounters with Victor Marek---a personal account (Q1028637) (← links)
- Hyperequivalence of logic programs with respect to supported models (Q1028652) (← links)
- Jump number problem: The role of matroids (Q1057289) (← links)
- Note on the decomposition of \(\lambda K_{m,n}\) (\(\lambda K^*_{m,n}\)) into paths (Q1066165) (← links)
- Linear upper bounds for local Ramsey numbers (Q1087887) (← links)
- (Q1128114) (redirect page) (← links)
- \((g,f)\)-factorizations orthogonal to a subgraph of a graph (Q1128115) (← links)
- Once more on storage for consecutive retrieval (Q1136500) (← links)
- A simple algorithm for finding a cycle of length greater than three and without diagonals (Q1147514) (← links)
- Primal graphs with small degrees (Q1174168) (← links)
- Asymptotic results on saturated graphs (Q1174171) (← links)
- Decompositions of regular bipartite graphs (Q1176735) (← links)
- Decompositions of graphs into forests with bounded maximum degree (Q1185098) (← links)
- Indexing functions and time lower bounds for sorting on a mesh-connected computer (Q1192947) (← links)
- Generalized local colorings of graphs (Q1193560) (← links)
- Rado's Selection Principle: Applications to binary relations, graph and hypergraph colorings and partially ordered sets (Q1195481) (← links)
- A characterization of uniquely vertex colorable graphs using minimal defining sets (Q1297453) (← links)
- Majorization, packing, covering and matroids (Q1309465) (← links)
- Minimal knowledge problem: A new approach (Q1329374) (← links)
- Probabilistic multi-knowledge-base systems (Q1330415) (← links)
- A knowledge-based approach to the local area network design problem (Q1330416) (← links)
- Packing problems in edge-colored graphs (Q1331890) (← links)
- Modal logic for default reasoning (Q1356222) (← links)
- Delta-system decompositions of graphs (Q1356709) (← links)
- A note on local colorings of graphs (Q1356713) (← links)
- On the tree number of regular graphs (Q1356782) (← links)
- Uniquely total colorable graphs (Q1376076) (← links)
- Representation theory for default logic (Q1376095) (← links)
- Better approximations of non-Hamiltonian graphs (Q1382268) (← links)
- Revision programming (Q1389448) (← links)
- Annotated revision programs (Q1603740) (← links)
- Computing with default logic (Q1606312) (← links)
- Preference learning and optimization for partial lexicographic preference forests over combinatorial domains (Q1647497) (← links)
- Orthogonal decomposition and packing of complete graphs (Q1806215) (← links)
- Uniform semantic treatment of default and autoepistemic logics (Q1853682) (← links)
- Satisfiability and computing van der Waerden numbers (Q1883655) (← links)
