Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
66 | Jiong Guo, Falk Hüffner, Rolf Niedermeier |
A Structural View on Parameterizing Problems: Distance from Triviality. |
IWPEC |
2004 |
DBLP DOI BibTeX RDF |
|
51 | Jose Rojas, Matthew Chalmers |
The Appropriation of Information and Communication Technology: A Cross-Cultural Perspective. |
HCI (1) |
2009 |
DBLP DOI BibTeX RDF |
socialisation, triviality, commoditisation, context, layout, marketing, ICT, infrastructure, relevance, space, place, media, business, meaning, Appropriation, domestication, social practices, peer support |
46 | Tania Paneni, Romano Scozzafava |
Multi-valued Conditional Events Avoid Lewis' Triviality Result. |
ECSQARU |
2003 |
DBLP DOI BibTeX RDF |
|
46 | Arief Daynes |
A strictly finitary non-triviality proof for a paraconsistent system of set theory deductively equivalent to classical ZFC minus foundation. |
Arch. Math. Log. |
2000 |
DBLP DOI BibTeX RDF |
|
40 | Anbu Yue, Yue Ma 0009, Zuoquan Lin |
Four-Valued Semantics for Default Logic. |
Canadian AI |
2006 |
DBLP DOI BibTeX RDF |
|
31 | Marcos Kawazoe Aguilera, Svend Frølund, Vassos Hadzilacos, Stephanie Lorraine Horn, Sam Toueg |
Abortable and query-abortable objects and their efficient implementation. |
PODC |
2007 |
DBLP DOI BibTeX RDF |
abortable types, non-triviality, universal constructions, shared memory, memory contention, obstruction-freedom |
31 | Mihir Bellare, Oded Goldreich 0001, Madhu Sudan 0001 |
Free Bits, PCPs and Non-Approximability - Towards Tight Results. |
FOCS |
1995 |
DBLP DOI BibTeX RDF |
free bits, logarithmic randomness, amortized free bits, Max Clique, Max-2-SAT, FGLSS connection, amortized free-bit complexity, amortized free bit complexity, FPCP parameters, triviality results, computational complexity, computational geometry, theorem proving, NP-hardness, NP complete problems, proof systems, chromatic number, PCPs, Max-cut, nonapproximability |
25 | Matthias C. Caro |
From undecidability of non-triviality and finiteness to undecidability of learnability. |
Int. J. Approx. Reason. |
2023 |
DBLP DOI BibTeX RDF |
|
25 | Xin You, Hailong Yang, Kelun Lei, Zhongzhi Luan, Depei Qian |
TrivialSpy: Identifying Software Triviality via Fine-grained and Dataflow-based Value Profiling. |
SC |
2023 |
DBLP DOI BibTeX RDF |
|
25 | Akanksha Agrawal 0001, M. S. Ramanujan 0001 |
Distance from Triviality 2.0: Hybrid Parameterizations. |
IWOCA |
2022 |
DBLP DOI BibTeX RDF |
|
25 | Alexander R. Pruss |
Erratum for "Conditionals and Conditional Probabilities without Triviality". |
Notre Dame J. Formal Log. |
2020 |
DBLP DOI BibTeX RDF |
|
25 | Pranav Arora, Aritra Banik, Vijay Kumar Paliwal, Venkatesh Raman 0001 |
List-coloring - Parameterizing from triviality. |
Theor. Comput. Sci. |
2020 |
DBLP DOI BibTeX RDF |
|
25 | Tao Zheng |
Characterizing Triviality of the Exponent Lattice of A Polynomial through Galois and Galois-Like Groups. |
CoRR |
2020 |
DBLP BibTeX RDF |
|
25 | Xinghan Liu |
Monotonicity in Intuitionistic Minimal Change Semantics Given Gärdenfors' Triviality Result. |
TLLM |
2020 |
DBLP DOI BibTeX RDF |
|
25 | Tao Zheng |
Characterizing Triviality of the Exponent Lattice of a Polynomial Through Galois and Galois-Like Groups. |
CASC |
2020 |
DBLP DOI BibTeX RDF |
|
25 | Daniel Deasy |
The triviality argument against presentism. |
Synth. |
2019 |
DBLP DOI BibTeX RDF |
|
25 | Alexander R. Pruss |
Conditionals and Conditional Probabilities without Triviality. |
Notre Dame J. Formal Log. |
2019 |
DBLP DOI BibTeX RDF |
|
25 | Paul Schweizer |
Triviality Arguments Reconsidered. |
Minds Mach. |
2019 |
DBLP DOI BibTeX RDF |
|
25 | Eric Raidl |
Lewis' Triviality for Quasi Probabilities. |
J. Log. Lang. Inf. |
2019 |
DBLP DOI BibTeX RDF |
|
25 | Fredrik Haraldsen |
Rigidity and triviality. |
Synth. |
2018 |
DBLP DOI BibTeX RDF |
|
25 | Noam Greenberg, Joseph S. Miller, Benoit Monin, Daniel Turetsky |
Two More Characterizations of K-Triviality. |
Notre Dame J. Formal Log. |
2018 |
DBLP DOI BibTeX RDF |
|
25 | Roberto Saia, Ludovico Boratto, Salvatore Carta |
Popularity Does Not Always Mean Triviality: Introduction of Popularity Criteria to Improve the Accuracy of a Recommender System. |
J. Comput. |
2017 |
DBLP DOI BibTeX RDF |
|
25 | Rohan French, Shawn Standefer |
Non-triviality Done Proof-Theoretically. |
LORI |
2017 |
DBLP DOI BibTeX RDF |
|
25 | Ihechukwu Chinyere, James Howie |
Non-triviality of some one-relator products of three groups. |
Int. J. Algebra Comput. |
2016 |
DBLP DOI BibTeX RDF |
|
25 | Tore Fjetland Øgaard |
Paths to Triviality. |
J. Philos. Log. |
2016 |
DBLP DOI BibTeX RDF |
|
25 | Peter Franek, Marek Krcál |
On Computability and Triviality of Well Groups. |
Discret. Comput. Geom. |
2016 |
DBLP DOI BibTeX RDF |
|
25 | Ittay Nissan-Rozen |
A triviality result for the "Desire by Necessity" thesis. |
Synth. |
2015 |
DBLP DOI BibTeX RDF |
|
25 | A. I. Zobnin, M. A. Limonov |
Algorithm for checking triviality of "mixed" ideals in the ring of differential polynomials. |
Program. Comput. Softw. |
2015 |
DBLP DOI BibTeX RDF |
|
25 | Kenshi Miyabe |
Schnorr Triviality and Its Equivalent Notions. |
Theory Comput. Syst. |
2015 |
DBLP DOI BibTeX RDF |
|
25 | Peter Franek, Marek Krcál |
On Computability and Triviality of Well Groups. |
CoRR |
2015 |
DBLP BibTeX RDF |
|
25 | Joel Nagloo |
Geometric triviality of the strongly minimal second Painlevé equations. |
Ann. Pure Appl. Log. |
2015 |
DBLP DOI BibTeX RDF |
|
25 | Peter Franek, Marek Krcál |
On Computability and Triviality of Well Groups. |
SoCG |
2015 |
DBLP DOI BibTeX RDF |
|
25 | Ulli Wolff |
Triviality of four dimensional phi^4 theory on the lattice. |
Scholarpedia |
2014 |
DBLP DOI BibTeX RDF |
|
25 | Gemma Robles, José M. Méndez |
Blocking the Routes to Triviality with Depth Relevance. |
J. Log. Lang. Inf. |
2014 |
DBLP DOI BibTeX RDF |
|
25 | Deepak Ponvel Chermakani |
A Non-Triviality Certificate for Scalars and its application to Linear Systems |
CoRR |
2012 |
DBLP BibTeX RDF |
|
25 | William C. Calhoun |
Triviality and Minimality in the Degrees of Monotone Complexity. |
J. Log. Comput. |
2012 |
DBLP DOI BibTeX RDF |
|
25 | Hemanta K. Maji, Manoj Prabhakaran 0001, Mike Rosulek |
A Unified Characterization of Completeness and Triviality for Secure Function Evaluation. |
INDOCRYPT |
2012 |
DBLP DOI BibTeX RDF |
|
25 | Laurent Bienvenu, Wolfgang Merkle, André Nies |
Solovay functions and K-triviality. |
STACS |
2011 |
DBLP DOI BibTeX RDF |
|
25 | Johanna N. Y. Franklin |
Schnorr triviality and genericity. |
J. Symb. Log. |
2010 |
DBLP DOI BibTeX RDF |
|
25 | Hannes Leitgeb |
On the Ramsey Test without Triviality. |
Notre Dame J. Formal Log. |
2010 |
DBLP DOI BibTeX RDF |
|
25 | Marie Duzí |
The Paradox of Inference and the Non-Triviality of Analytic Information. |
J. Philos. Log. |
2010 |
DBLP DOI BibTeX RDF |
|
25 | George Barmpalias, Douglas A. Cenzer, Jeffrey B. Remmel, Rebecca Weber |
K-Triviality of Closed Sets and Continuous Functions. |
J. Log. Comput. |
2009 |
DBLP DOI BibTeX RDF |
|
25 | Johanna N. Y. Franklin |
Hyperimmune-free degrees and Schnorr triviality. |
J. Symb. Log. |
2008 |
DBLP DOI BibTeX RDF |
|
25 | Bruno Escoffier, Jérôme Monnot, Olivier Spanjaard |
Some Tractable Instances of Interval Data Minmax Regret Problems: Bounded Distance from Triviality. |
SOFSEM |
2008 |
DBLP DOI BibTeX RDF |
Bipartite perfect matching, Shortest path, Spanning tree, Robust optimization, Interval data |
25 | Federico Marulanda Rey |
Dialetheic truth theory: inconsistency, non-triviality, soundness, incompleteness. |
LA-NMR |
2007 |
DBLP BibTeX RDF |
|
25 | Susan Rogerson, Greg Restall |
Routes to Triviality. |
J. Philos. Log. |
2004 |
DBLP DOI BibTeX RDF |
|
25 | Wagner de Campos Sanz |
Relating Intuitionist Negation and Triviality. |
Log. J. IGPL |
2004 |
DBLP DOI BibTeX RDF |
|
25 | Viktor Verbovskiy, Ikuo Yoneda |
CM-triviality and relational structures. |
Ann. Pure Appl. Log. |
2003 |
DBLP DOI BibTeX RDF |
|
25 | Ikuo Yoneda |
CM-triviality and generic structures. |
Arch. Math. Log. |
2003 |
DBLP DOI BibTeX RDF |
|
25 | Andreas Baudisch |
Mekler's construction preserves CM-triviality. |
Ann. Pure Appl. Log. |
2002 |
DBLP DOI BibTeX RDF |
|
25 | Oliver Jenkinson |
Strong cocycle triviality for Z2 subshifts. |
Theor. Comput. Sci. |
2001 |
DBLP DOI BibTeX RDF |
|
25 | Anand Pillay |
A Note on CM-Triviality and The Geometry of Forking. |
J. Symb. Log. |
2000 |
DBLP DOI BibTeX RDF |
|
25 | Richard Bradley |
More Triviality. |
J. Philos. Log. |
1999 |
DBLP DOI BibTeX RDF |
|
25 | Graham Priest |
Semantic Closure, Descriptions and Non-Triviality. |
J. Philos. Log. |
1999 |
DBLP DOI BibTeX RDF |
|
25 | Frank O. Wagner |
CM-Triviality and Stable Groups. |
J. Symb. Log. |
1998 |
DBLP DOI BibTeX RDF |
|
25 | Graham Priest |
The Trivial Object and the Non-Triviality of a Semantically Closed Theory with Descriptions. |
J. Appl. Non Class. Logics |
1998 |
DBLP DOI BibTeX RDF |
|
25 | Abdelilah Kandri-Rody, Hamid Maarouf, Mohamed Ssafini |
Triviality and Dimension of a System of Algebraic Differential Equations. |
J. Autom. Reason. |
1998 |
DBLP DOI BibTeX RDF |
|
25 | Peter Milne |
Avoiding triviality: Fuzzy implications and conditional events. |
Int. J. Approx. Reason. |
1996 |
DBLP DOI BibTeX RDF |
|
25 | Charles G. Morgan, Edwin D. Mares |
Conditionals, probability, and non-triviality. |
J. Philos. Log. |
1995 |
DBLP DOI BibTeX RDF |
|
25 | Bradd Hart, Anand Pillay, Sergei Starchenko |
Triviality, NDOP and Stable Varieties. |
Ann. Pure Appl. Log. |
1993 |
DBLP DOI BibTeX RDF |
|
25 | Peter Gärdenfors, Sten Lindström, Michael Morreau, Wlodzimierz Rabinowicz |
The negative Ramsey test: another triviality result. |
The Logic of Theory Change |
1989 |
DBLP DOI BibTeX RDF |
|
25 | Peter Gärdenfors |
Variations on the Ramsey test: More triviality results. |
Stud Logica |
1987 |
DBLP DOI BibTeX RDF |
|
25 | Pawel Urzyczyn |
Algorithmic triviality of abstract structures. |
Fundam. Informaticae |
1981 |
DBLP BibTeX RDF |
|
20 | Otávio A. S. Bueno, Newton C. A. da Costa |
Quasi-truth, paraconsistency, and the foundations of science. |
Synth. |
2007 |
DBLP DOI BibTeX RDF |
Scientific change, Coherence, Inconsistency, Paraconsistent logic, Rationality |
20 | George Barmpalias, Douglas A. Cenzer, Jeffrey B. Remmel, Rebecca Weber |
K -Trivial Closed Sets and Continuous Functions. |
CiE |
2007 |
DBLP DOI BibTeX RDF |
Computability, Randomness, Classes |
20 | Anna Zamansky, Arnon Avron |
Cut-Elimination and Quantification in Canonical Systems. |
Stud Logica |
2006 |
DBLP DOI BibTeX RDF |
canonical systems, proof theory, cut elimination, non-deterministic matrices |
20 | Anna Zamansky, Arnon Avron |
Canonical Gentzen-Type Calculi with (n, k)-ary Quantifiers. |
IJCAR |
2006 |
DBLP DOI BibTeX RDF |
|
20 | Steffen Mecke, Dorothea Wagner |
Solving Geometric Covering Problems by Data Reduction. |
ESA |
2004 |
DBLP DOI BibTeX RDF |
|
20 | Arnon Avron, Iddo Lev |
Canonical Propositional Gentzen-Type Systems. |
IJCAR |
2001 |
DBLP DOI BibTeX RDF |
|
20 | Aaron N. Kaplan |
Towards a consistent logical framework for ontological analysis. |
FOIS |
2001 |
DBLP DOI BibTeX RDF |
ontology, taxonomy |
20 | Laura Giordano 0001, Valentina Gliozzi, Nicola Olivetti |
Belief Revision and the Ramsey Test: A Solution. |
AI*IA |
2001 |
DBLP DOI BibTeX RDF |
|
20 | M. R. Darafsheh, Mohammad Reza Pournaki |
Computation of the Dimensions of Symmetry Classes of Tensors Associated with the Finite two Dimensional Projective Special Linear Group. |
Appl. Algebra Eng. Commun. Comput. |
2000 |
DBLP DOI BibTeX RDF |
Symmetry classes of tensors, Actions of symmetric groups, Irreducible characters, Projective special linear group |
20 | Laura Giordano 0001, Valentina Gliozzi, Nicola Olivetti |
A Conditional Logic for Belief Revision. |
JELIA |
1998 |
DBLP DOI BibTeX RDF |
|
20 | Edward Cherlin |
APL Trivia. |
APL |
1990 |
DBLP DOI BibTeX RDF |
APL |
20 | Hans Rott |
A nonmonotonic conditional logic for belief revision. Part 1: Semantics and logic of simple conditionals. |
The Logic of Theory Change |
1989 |
DBLP DOI BibTeX RDF |
|
20 | Karoline Malmkjær |
On Some Semantic Issues in the Reflective Tower. |
Mathematical Foundations of Programming Semantics |
1989 |
DBLP DOI BibTeX RDF |
|