|
|
Venues (Conferences, Journals, ...)
|
|
GrowBag graphs for keyword ? (Num. hits/coverage)
Group by:
The graphs summarize 6478 occurrences of 2994 keywords
|
|
|
Results
Found 18348 publication records. Showing 18348 according to the selection in the facets
Hits ?▲ |
Authors |
Title |
Venue |
Year |
Link |
Author keywords |
78 | Alexej P. Pynko |
A relative interpolation theorem for infinitary universal Horn logic and its applications. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Arch. Math. Log. ![In: Arch. Math. Log. 45(3), pp. 267-305, 2006. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
Universal Horn theory, Interpolation theorem, Preservation theorem, Definability theorem |
62 | Lai-Jiu Lin 0001, Wei-Shih Du |
Systems of equilibrium problems with applications to new variants of Ekeland's variational principle, fixed point theorems and parametric optimization problems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Glob. Optim. ![In: J. Glob. Optim. 40(4), pp. 663-677, 2008. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
?-function, Quasi-distance, Ekeland’s variational principle, Flower petal theorem, Maximal element theorem, Minimax theorem, Minimization theorem, Semi-infinite problem, Generalized Schauder’s fixed point theorem, Equilibrium problem |
50 | Mihaly Agfalvi, Istvan Kadar, Erik Papp |
Generalization of Pick's theorem for surface of polyhedra. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APL ![In: Proceedings of the International Conference on all Array Programming Languages, ALP 1999, Scranton, PA, USA, August 10-14, 1999., pp. 1-12, 1999, ACM, 1-58113-126-7. The full citation details ...](Pics/full.jpeg) |
1999 |
DBLP DOI BibTeX RDF |
APL |
50 | Hiroyuki Honda, Miki Haseyama, Hideo Kitajima, S. Matsumoto |
Extension of the Collage Theorem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICIP (2) ![In: Proceedings 1997 International Conference on Image Processing, ICIP '97, Santa Barbara, California, USA, October 26-29, 1997, pp. 306-309, 1997, IEEE Computer Society, 0-8186-8183-7. The full citation details ...](Pics/full.jpeg) |
1997 |
DBLP DOI BibTeX RDF |
collage theorem, fractal image compression, extended collage theorem, IFS algorithm, contraction mappings, data compression, quality, errors, iteration, iterative function system, reconstructed image |
47 | Raul H. C. Lopes, Mark Tarver |
Inducing Theorem Provers from Proofs. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICTAI ![In: 9th International Conference on Tools with Artificial Intelligence, ICTAI '97, Newport Beach, CA, USA, November 3-8, 1997, pp. 157-164, 1997, IEEE Computer Society, 0-8186-8203-5. The full citation details ...](Pics/full.jpeg) |
1997 |
DBLP DOI BibTeX RDF |
theorem prover induction, automatic theorem prover generation, proof examples, intuitionistic propositional calculus, depth-first search strategy, loop detection, inductive generalization, machine learning, theorem proving |
41 | Yuyan Chao, Lifeng He, Tsuyoshi Nakamura, Zhenghao Shi, Kenji Suzuki 0001, Hidenori Itoh |
An Improvement of Herbrand's Theorem and Its Application to Model Generation Theorem Proving. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Comput. Sci. Technol. ![In: J. Comput. Sci. Technol. 22(4), pp. 541-553, 2007. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
Herbrand’s theorem, Herbrand universe, model generation theorem proving, SATCHMO, really non-propositinal |
41 | Ken-ichi Kawarabayashi, Bruce A. Reed |
Hadwiger's conjecture is decidable. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STOC ![In: Proceedings of the 41st Annual ACM Symposium on Theory of Computing, STOC 2009, Bethesda, MD, USA, May 31 - June 2, 2009, pp. 445-454, 2009, ACM, 978-1-60558-506-2. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
Hadwiger's conjecture, the four color theorem |
39 | Shang-Ching Chou, Xiao-Shan Gao |
Ritt-Wu's Decomposition Algorithm and Geometry Theorem Proving. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CADE ![In: 10th International Conference on Automated Deduction, Kaiserslautern, FRG, July 24-27, 1990, Proceedings, pp. 207-220, 1990, Springer, 3-540-52885-7. The full citation details ...](Pics/full.jpeg) |
1990 |
DBLP DOI BibTeX RDF |
Wu's method, prover, elementary geometry, degenerate conditions, Ritt-Wu's principle, ascending chain, the dimension theorem, Morley's trisector theorem, ideal, mechanical theorem proving, algebraic variety |
38 | Xiao-Shan Gao, Qiang Lin |
MMP/Geometer - A Software Package for Automated Geometric Reasoning. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Automated Deduction in Geometry ![In: Automated Deduction in Geometry, 4th International Workshop, ADG 2002, Hagenberg Castle, Austria, September 4-6, 2002, Revised Papers, pp. 44-66, 2002, Springer, 3-540-20927-1. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
Geometry software, geometric theorem discovering, geometric diagram generation, intelligent dynamic geometry, automated reasoning, geometric theorem proving |
38 | Christian Pech |
Kleene's Theorem for Weighted Tree-Automata. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FCT ![In: Fundamentals of Computation Theory, 14th International Symposium, FCT 2003, Malmö, Sweden, August 12-15, 2003, Proceedings, pp. 387-399, 2003, Springer, 3-540-40543-7. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
Kleenes theorem, Schützenbergers theorem, rational expression, tree, language, automata, weight |
36 | Quan Liu, Yang Gao 0001, Zhiming Cui, WangShu Yao, ZhongWen Chen |
An Tableau Automated Theorem Proving Method Using Logical Reinforcement Learning. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISICA ![In: Advances in Computation and Intelligence, Second International Symposium, ISICA 2007, Wuhan, China, September 21-23, 2007, Proceedings, pp. 262-270, 2007, Springer, 978-3-540-74580-8. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
logical reinforcement learning, tableau automated theorem proving, LOMDP |
35 | Vasco Brattka |
Borel complexity and computability of the Hahn-Banach Theorem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Arch. Math. Log. ![In: Arch. Math. Log. 46(7-8), pp. 547-564, 2008. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
Mathematics Subject Classification (2000) 03F60, 46S30, 03E15 |
35 | Gianni Bosi, Gerhard Herden |
On a Possible Continuous Analogue of the Szpilrajn Theorem and its Strengthening by Dushnik and Miller. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Order ![In: Order 23(4), pp. 271-296, 2006. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
Mathematics Subject Classifications (2000) 54F05, 06A05, 91B16 |
35 | Shang-Ching Chou |
A Geometry Theorem Prover for Macintoshes. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CADE ![In: Automated Deduction - CADE-11, 11th International Conference on Automated Deduction, Saratoga Springs, NY, USA, June 15-18, 1992, Proceedings, pp. 686-690, 1992, Springer, 3-540-55602-8. The full citation details ...](Pics/full.jpeg) |
1992 |
DBLP DOI BibTeX RDF |
|
35 | Maria Paola Bonacina, Jieh Hsiang |
On Fairness of Completion-Based Theorem Proving Strategies. ![Search on Bibsonomy](Pics/bibsonomy.png) |
RTA ![In: Rewriting Techniques and Applications, 4th International Conference, RTA-91, Como, Italy, April 10-12, 1991, Proceedings, pp. 348-360, 1991, Springer, 3-540-53904-2. The full citation details ...](Pics/full.jpeg) |
1991 |
DBLP DOI BibTeX RDF |
|
35 | Jieh Hsiang, Mandayam K. Srivas |
PROLOG-Based Inductive Theorem Proving. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FSTTCS ![In: Foundations of Software Technology and Theoretical Computer Science, Fifth Conference, New Delhi, India, December 16-18, 1985, Proceedings, pp. 129-149, 1985, Springer, 3-540-16042-6. The full citation details ...](Pics/full.jpeg) |
1985 |
DBLP DOI BibTeX RDF |
|
34 | Micha A. Perles, Horst Martini, Yaakov S. Kupitz |
A Jordan-Brouwer Separation Theorem for Polyhedral Pseudomanifolds. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Discret. Comput. Geom. ![In: Discret. Comput. Geom. 42(2), pp. 277-304, 2009. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
Bing’s house, Euler’s formula, Jordan-Brouwer theorem, Jordan’s curve theorem, Jordan exterior (interior), Polygonal diameter, Polyhedral manifold, Triangulation, Dual graph |
32 | Sandip Ray, Rob Sumners |
Combining Theorem Proving with Model Checking through Predicate Abstraction. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Des. Test Comput. ![In: IEEE Des. Test Comput. 24(2), pp. 132-139, 2007. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
model checking, formal verification, theorem proving, predicate abstraction, ACL2 |
32 | Daniel Fridlender |
An Interpretation of the Fan Theorem in Type Theory. ![Search on Bibsonomy](Pics/bibsonomy.png) |
TYPES ![In: Types for Proofs and Programs, International Workshop TYPES '98, Kloster Irsee, Germany, March 27-31, 1998, Selected Papers, pp. 93-105, 1998, Springer, 3-540-66537-4. The full citation details ...](Pics/full.jpeg) |
1998 |
DBLP DOI BibTeX RDF |
fan theorem, inductive bar, type theory |
32 | Thomas H. Reiss |
The revised Fundamental Theorem of Moment Invariants. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Pattern Anal. Mach. Intell. ![In: IEEE Trans. Pattern Anal. Mach. Intell. 13(8), pp. 830-834, 1991. The full citation details ...](Pics/full.jpeg) |
1991 |
DBLP DOI BibTeX RDF |
fundamental theorem, similitude, general linear transformations, pattern recognition, pattern recognition, invariance, invariance, algebra, algebra, rotation invariants, moment invariants |
32 | Sun Yong-qiang, Lu Ru-zhan, Bi Hua |
Program synthesis based on Boyer-Moore theorem proving techniques. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACM Conference on Computer Science ![In: Proceedings of the 13th ACM Annual Conference on Computer Science, New Orleans, Louisiana, USA, 1985, pp. 348-355, 1985, ACM, 0-89791-150-4. The full citation details ...](Pics/full.jpeg) |
1985 |
DBLP DOI BibTeX RDF |
Boyer-Moore technique, program sysnthesis, theorem proving, resolution |
32 | David R. Lester |
Real Number Calculations and Theorem Proving. ![Search on Bibsonomy](Pics/bibsonomy.png) |
TPHOLs ![In: Theorem Proving in Higher Order Logics, 21st International Conference, TPHOLs 2008, Montreal, Canada, August 18-21, 2008. Proceedings, pp. 215-229, 2008, Springer, 978-3-540-71065-3. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
Computable Reals, Exact Arithmetic, Theorem Proving, PVS, Higher-order Logic |
32 | Anand Chavan, Shiu-Kai Chin, Shahid Ikram, Jang Dae Kim, Juin-Yeu Zu |
Extending VLSI design with higher-order logic. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICCD ![In: 1995 International Conference on Computer Design (ICCD '95), VLSI in Computers and Processors, October 2-4, 1995, Austin, TX, USA, Proceedings, pp. 85-94, 1995, IEEE Computer Society, 0-8186-7165-3. The full citation details ...](Pics/full.jpeg) |
1995 |
DBLP DOI BibTeX RDF |
Cambridge Higher-Order Logic theorem-prover, microprogram sequencer, Am2910, VLSI, formal verification, formal verification, logic testing, theorem proving, logic design, logic CAD, VLSI design, higher-order logic, theorem-prover, design environment, instruction-set architecture, VLSI CAD |
31 | Yunnan Wu, Kamal Jain, Sun-Yuan Kung |
A unification of network coding and tree-packing (routing) theorems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Inf. Theory ![In: IEEE Trans. Inf. Theory 52(6), pp. 2398-2409, 2006. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
routing, multicast, network coding, steiner tree, flow |
31 | Irit Dinur |
The PCP theorem by gap amplification. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. ACM ![In: J. ACM 54(3), pp. 12, 2007. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
Gap amplification, PCP |
31 | Gianni Bosi, Gerhard Herden |
On a Strong Continuous Analogue of the Szpilrajn Theorem and its Strengthening by Dushnik and Miller. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Order ![In: Order 22(4), pp. 329-342, 2005. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
Mathematics Subject Classification (2000) 54F05, 06A05, 91B16 |
31 | Weiqiang Kong, Takahiro Seino, Kokichi Futatsugi, Kazuhiro Ogata 0001 |
A Lightweight Integration of Theorem Proving and Model Checking for System Verification. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APSEC ![In: 12th Asia-Pacific Software Engineering Conference (APSEC 2005), 15-17 December 2005, Taipei, Taiwan, pp. 59-66, 2005, IEEE Computer Society, 0-7695-2465-6. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
31 | Zdzislaw Pawlak |
The Rough Set View on Bayes' Theorem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
AFSS ![In: Advances in Soft Computing - AFSS 2002, 2002 AFSS International Conference on Fuzzy Systems. Calcutta, India, February 3-6, 2002, Proceedings, pp. 106-120, 2002, Springer, 3-540-43150-0. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
|
31 | Yun Wang, Yanyong Guan, Hongkai Wang, Kaiquan Shi |
An Improved Intermediate Value Theorem and Rough Fix-Point Theorem of Roughly Continuous Discrete Functions. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FSKD (5) ![In: Fifth International Conference on Fuzzy Systems and Knowledge Discovery, FSKD 2008, 18-20 October 2008, Jinan, Shandong, China, Proceedings, Volume 5, pp. 241-245, 2008, IEEE Computer Society. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
|
31 | Sreeranga P. Rajan, Jeffrey J. Joyce, Carl-Johan H. Seger |
From Abstract Data Types to Shift Registers: A Case Study in Formal Specification and Verification at Differing Levels of Abstraction using Theorem Proving and Symbolic Simulation. ![Search on Bibsonomy](Pics/bibsonomy.png) |
HUG ![In: Higher Order Logic Theorem Proving and its Applications, 6th International Workshop, HUG '93, Vancouver, BC, Canada, August 11-13, 1993, Proceedings, pp. 489-500, 1993, Springer, 3-540-57826-9. The full citation details ...](Pics/full.jpeg) |
1993 |
DBLP DOI BibTeX RDF |
|
30 | Randall W. Lichota, Grace L. Hammonds, Stephen H. Brackin |
Verifying The Correctness Of Cryptographic Protocols Using "Convince". ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACSAC ![In: 12th Annual Computer Security Applications Conference (ACSAC 1996), 9-13 December 1996, San Diego, CA, USA, pp. 117-128, 1996, IEEE Computer Society. The full citation details ...](Pics/full.jpeg) |
1996 |
DBLP DOI BibTeX RDF |
Convince, theorem proving component, commercial computer aided software engineering tool, StP/OMT, textual notations, Higher Order Logic theorem prover, protocols, cryptographic protocols, authentication protocols, front-end, belief logic, correctness verification, automated support |
30 | Marc Bezem, Dimitri Hendriks |
On the Mechanization of the Proof of Hessenberg's Theorem in Coherent Logic. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Autom. Reason. ![In: J. Autom. Reason. 40(1), pp. 61-85, 2008. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
Coherent logic, Proof objects, Hessenberg’s theorem, Automated theorem proving |
30 | Keith Vanderveen, C. V. Ramamoorthy |
Partial instantiation theorem proving for distributed resource location. ![Search on Bibsonomy](Pics/bibsonomy.png) |
COMPSAC ![In: 21st International Computer Software and Applications Conference (COMPSAC '97), 11-15 August 1997, Washington, DC, USA, pp. 192-197, 1997, IEEE Computer Society, 0-8186-8105-5. The full citation details ...](Pics/full.jpeg) |
1997 |
DBLP DOI BibTeX RDF |
partial instantiation theorem prover, distributed resource location, INSTANT, clausal form, non clausal form, GSAT algorithm, propositional sentence, request matching, CORBA Object Trading Service, KIF, theorem proving, satisfiability, first order logic, KQML |
30 | Chih-Hung Wu, Shie-Jue Lee |
On parallelism of hyper-linking theorem proving: a preliminary report. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICPADS ![In: 1996 International Conference on Parallel and Distributed Systems (ICPADS '96), June 3-6, 1996, Tokyo, Japan, Proceedings, pp. 494-499, 1996, IEEE Computer Society, 0-8186-7267-6. The full citation details ...](Pics/full.jpeg) |
1996 |
DBLP DOI BibTeX RDF |
hyper-linking theorem proving, hyper-linking proof procedure, phase-level, clause-level, literal-level, search level parallelism, parallel strategies, parallel algorithms, parallelism, artificial intelligence, parallel architectures, theorem proving |
30 | Stefan Gerberding |
DT - An Automated Theorem Prover for Multiple-Valued First-Order Predicate Logics. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISMVL ![In: 26th IEEE International Symposium on Multiple-Valued Logic, ISMVL 1996, Santiago de Compostela, Spain, May 29-31, 1996, Proceedings, pp. 284-289, 1996, IEEE Computer Society, 0-8186-7392-3. The full citation details ...](Pics/full.jpeg) |
1996 |
DBLP DOI BibTeX RDF |
Deep Thought, multiple-valued first-order logics, lemma generation, tableau expansion, branch closure, theorem proving, multivalued logic, multiple-valued logics, quantifiers, first-order predicate logic, truth tables, automated theorem prover |
30 | David Cyrluk, Mandayam K. Srivas |
Theorem proving: not an esoteric diversion, but the unifying framework for industrial verification. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICCD ![In: 1995 International Conference on Computer Design (ICCD '95), VLSI in Computers and Processors, October 2-4, 1995, Austin, TX, USA, Proceedings, pp. 538-544, 1995, IEEE Computer Society, 0-8186-7165-3. The full citation details ...](Pics/full.jpeg) |
1995 |
DBLP DOI BibTeX RDF |
industrial hardware verification, industrial verification, formal verification, logic testing, theorem proving, theorem prover, hardware verification |
30 | Dipankar Sarkar 0001, S. C. De Sarkar |
A Theorem Prover for Verifying Iterative Programs Over Integers. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Software Eng. ![In: IEEE Trans. Software Eng. 15(12), pp. 1550-1566, 1989. The full citation details ...](Pics/full.jpeg) |
1989 |
DBLP DOI BibTeX RDF |
rule-based theorem prover, iterative programs, overall proof construction strategy, array-sorting program, expert systems, theorem proving, program verification, performance measures, iterative methods, correctness proofs |
29 | Katarína Cunderlíková |
The individual ergodic theorem on the IF-events with product. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Soft Comput. ![In: Soft Comput. 14(3), pp. 229-234, 2010. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP DOI BibTeX RDF |
The IF-event, The IF-probability, The IF-observable, The product, The upper and lower limits, The individual ergodic theorem, The almost everywhere convergence, The -preserving transformation |
29 | Olga Brezhneva, Alexey Tret'yakov, Stephen E. Wright |
A simple and elementary proof of the Karush-Kuhn-Tucker theorem for inequality-constrained optimization. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Optim. Lett. ![In: Optim. Lett. 3(1), pp. 7-10, 2009. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
Karush-Kuhn-Tucker theorem, Nonlinear programming |
29 | Jean-François Dufourd |
An Intuitionistic Proof of a Discrete Form of the Jordan Curve Theorem Formalized in Coq with Combinatorial Hypermaps. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. Autom. Reason. ![In: J. Autom. Reason. 43(1), pp. 19-51, 2009. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
Computer-aided proofs, Coq system, Combinatorial hypermaps, Discrete Jordan Curve Theorem, Formal specifications, Computational topology, Planar subdivisions |
29 | Akimasa Morihata, Kiminori Matsuzaki, Zhenjiang Hu, Masato Takeichi |
The third homomorphism theorem on trees: downward & upward lead to divide-and-conquer. ![Search on Bibsonomy](Pics/bibsonomy.png) |
POPL ![In: Proceedings of the 36th ACM SIGPLAN-SIGACT Symposium on Principles of Programming Languages, POPL 2009, Savannah, GA, USA, January 21-23, 2009, pp. 177-185, 2009, ACM, 978-1-60558-379-2. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
huet's zippers, polynomial data structures, the third homomorphism theorem, divide-and-conquer |
29 | Gilbert Labelle, Annie Lacasse |
Discrete Versions of Stokes' Theorem Based on Families of Weights on Hypercubes. ![Search on Bibsonomy](Pics/bibsonomy.png) |
DGCI ![In: Discrete Geometry for Computer Imagery, 15th IAPR International Conference, DGCI 2009, Montréal, Canada, September 30 - October 2, 2009. Proceedings, pp. 229-239, 2009, Springer, 978-3-642-04396-3. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
Discrete Stokes’ theorem, Poincaré lemma, hypercube |
29 | Antoni Torrens |
An Approach to Glivenko's Theorem in Algebraizable Logics. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Stud Logica ![In: Stud Logica 88(3), pp. 349-383, 2008. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
Glivenko’s Theorem, equivalential deductive system, compatible expansion, algebraic semantics, quasivariety, algebraizable logic |
29 | Satyadev Nandakumar |
An effective ergodic theorem and some applications. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STOC ![In: Proceedings of the 40th Annual ACM Symposium on Theory of Computing, Victoria, British Columbia, Canada, May 17-20, 2008, pp. 39-44, 2008, ACM, 978-1-60558-047-0. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
ergodic theorem, algorithmic randomness |
29 | Josef Berger |
The Logical Strength of the Uniform Continuity Theorem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CiE ![In: Logical Approaches to Computational Barriers, Second Conference on Computability in Europe, CiE 2006, Swansea, UK, June 30-July 5, 2006, Proceedings, pp. 35-39, 2006, Springer, 3-540-35466-2. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
Constructive reverse mathematics, uniform continuity theorem |
29 | Victoria Powers, Bruce Reznick |
A quantitative Pólya's Theorem with corner zeros. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISSAC ![In: Symbolic and Algebraic Computation, International Symposium, ISSAC 2006, Genoa, Italy, July 9-12, 2006, Proceedings, pp. 285-289, 2006, ACM, 1-59593-276-3. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
Pólya's Theorem, positive polynomials, sums of squares |
29 | Wing-Kwong Wong, Bo-Yu Chan, Sheng-Kai Yin |
A Dynamic Geometry Environment for Learning Theorem Proving. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICALT ![In: Proceedings of the 5th IEEE International Conference on Advanced Learning Technologies, ICALT 2005, Kaohsiung, Taiwan, July 5-8, 2005, pp. 15-17, 2005, IEEE Computer Society, 0-7695-2338-2. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
learning geometry, geometry education, theorem proving, Dynamic geometry |
29 | Youngsik Kim, Parija Sule, Nazanin Mansouri |
Exploiting PSL standard assertions in a theorem-proving-based verification environment. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACM Great Lakes Symposium on VLSI ![In: Proceedings of the 15th ACM Great Lakes Symposium on VLSI 2005, Chicago, Illinois, USA, April 17-19, 2005, pp. 400-403, 2005, ACM, 1-59593-057-4. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
assertion-based design, modeling, verification, theorem-proving, formal semantics, PSL |
29 | Hongbo Li 0012, Ronghua Xu, Ning Zhang |
On Miquel's Five-Circle Theorem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IWMM/GIAE ![In: Computer Algebra and Geometric Algebra with Applications, 6th International Workshop, IWMM 2004, Shanghai, China, May 19-21, 2004, and International Workshop, GIAE 2004, Xian, China, May 24-28, 2004, Revised Selected Papers, pp. 217-228, 2004, Springer, 3-540-26296-2. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
Miquel’s Theorem, Mathematics mechanization, Null bracket algebra, “breefs”, Conformal geometric algebra |
29 | Hongbo Li 0012 |
Algebraic Representation, Elimination and Expansion in Automated Geometric Theorem Proving. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Automated Deduction in Geometry ![In: Automated Deduction in Geometry, 4th International Workshop, ADG 2002, Hagenberg Castle, Austria, September 4-6, 2002, Revised Papers, pp. 106-123, 2002, Springer, 3-540-20927-1. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
Cayley algebra, bracket algebra, affine geometry, automated theorem proving, projective geometry, conics |
29 | Miroslav Popovic, Vladimir Kovacevic, Ivan Velikic |
A Formal Software Verification Concept Based on Automated Theorem Proving and Reverse Engineering. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ECBS ![In: 9th IEEE International Conference on Engineering of Computer-Based Systems (ECBS 2002), 8-11 April 2002, Lund, Sweden, pp. 59-66, 2002, IEEE Computer Society, 0-7695-1549-5. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
formal software verification, fault-tolerant and robust software, mission-critical embedded software, reverse engineering, automated theorem proving, predicate calculus |
29 | Fausto Giunchiglia, Paolo Traverso |
Theorem proving in technology transfer: the user's point of view. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Int. J. Softw. Tools Technol. Transf. ![In: Int. J. Softw. Tools Technol. Transf. 3(1), pp. 1-12, 2000. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP DOI BibTeX RDF |
Formal methods, Mechanized theorem proving |
29 | Werner Schindler |
A Timing Attack against RSA with the Chinese Remainder Theorem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CHES ![In: Cryptographic Hardware and Embedded Systems - CHES 2000, Second International Workshop, Worcester, MA, USA, August 17-18, 2000, Proceedings, pp. 109-124, 2000, Springer, 3-540-41455-X. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP DOI BibTeX RDF |
RSA, Chinese Remainder Theorem, Montgomery multiplication, Timing attack |
29 | Piergiorgio Bertoli, Jacques Calmet, Fausto Giunchiglia, Karsten Homann |
Specification and Integration of Theorem Provers and Computer Algebra Systems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
AISC ![In: Artificial Intelligence and Symbolic Computation, International Conference AISC'98, Plattsburgh, New York, USA, September 16-18, 1998, Proceedings, pp. 94-106, 1998, Springer, 3-540-64960-3. The full citation details ...](Pics/full.jpeg) |
1998 |
DBLP DOI BibTeX RDF |
Integration, Theorem Provers, Computer Algebra Systems, Formal Frameworks |
29 | Boutheina Chetali, Barbara Heyd |
Formal Verification of Concurrent Programs in LP and in COQ: A Comparative Analysis. ![Search on Bibsonomy](Pics/bibsonomy.png) |
TPHOLs ![In: Theorem Proving in Higher Order Logics, 10th International Conference, TPHOLs'97, Murray Hill, NJ, USA, August 19-22, 1997, Proceedings, pp. 69-85, 1997, Springer, 3-540-63379-0. The full citation details ...](Pics/full.jpeg) |
1997 |
DBLP DOI BibTeX RDF |
theorem prover methodology, Larch Prover, Computer Checked Proof, Formal Verification, Unity, Coq |
29 | Jianan Li, Ichiro Suzuki, Masafumi Yamashita |
A New Structural Induction Theorem for Rings of Temporal Petri Nets. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Software Eng. ![In: IEEE Trans. Software Eng. 20(2), pp. 115-126, 1994. The full citation details ...](Pics/full.jpeg) |
1994 |
DBLP DOI BibTeX RDF |
structural induction theorem, temporal Petri nets, identical components, temporal logic formula, similar behavior, demand-driven token circulation, Petri nets, formal verification, formal verification, temporal logic, correctness, temporal reasoning, rings |
29 | Wolfgang Ertel |
OR-Parallel Theorem Proving with Random Competition. ![Search on Bibsonomy](Pics/bibsonomy.png) |
LPAR ![In: Logic Programming and Automated Reasoning,International Conference LPAR'92, St. Petersburg, Russia, July 15-20, 1992, Proceedings, pp. 226-237, 1992, Springer, 3-540-55727-X. The full citation details ...](Pics/full.jpeg) |
1992 |
DBLP DOI BibTeX RDF |
random competition, SETHEO, theorem proving, speedup, OR-parallelism, random search, model elimination |
28 | Stephen Simons |
Minimax Theorems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Encyclopedia of Optimization ![In: Encyclopedia of Optimization, Second Edition, pp. 2087-2093, 2009, Springer, 978-0-387-74758-3. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
Minimax theorem, Hahn-Banach theorem, Connectedness, Fixed point theorem |
28 | Anna Avallone, Paolo Vitolo |
Effect algebras with the subsequential interpolation property. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Soft Comput. ![In: Soft Comput. 12(6), pp. 559-565, 2008. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
Subsequential interpolation, Vitali-Hahn-Saks theorem, Brooks-Jewett theorem, Nikodym boundedness theorem, property, Effect algebras |
27 | Daniele Micciancio, Saurabh Panjwani |
Adaptive Security of Symbolic Encryption. ![Search on Bibsonomy](Pics/bibsonomy.png) |
TCC ![In: Theory of Cryptography, Second Theory of Cryptography Conference, TCC 2005, Cambridge, MA, USA, February 10-12, 2005, Proceedings, pp. 169-187, 2005, Springer, 3-540-24573-1. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
27 | Alexander Leitsch |
Decision Procedures and Model Building, or How to Improve Logical Information in Automated Deduction. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FTP (LNCS Selection) ![In: Automated Deduction in Classical and Non-Classical Logics, Selected Papers, pp. 62-79, 1998, Springer, 3-540-67190-0. The full citation details ...](Pics/full.jpeg) |
1998 |
DBLP DOI BibTeX RDF |
|
27 | Ian Horrocks 0001, Andrei Voronkov |
Reasoning Support for Expressive Ontology Languages Using a Theorem Prover. ![Search on Bibsonomy](Pics/bibsonomy.png) |
FoIKS ![In: Foundations of Information and Knowledge Systems, 4th International Symposium, FoIKS 2006, Budapest, Hungary, February 14-17, 2006, Proceedings, pp. 201-218, 2006, Springer, 3-540-31782-1. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
27 | Rongde Lu, An Lu |
Applications of the Superposition Theorem to Nonlinear Resistive Circuits. ![Search on Bibsonomy](Pics/bibsonomy.png) |
APCCAS ![In: IEEE Asia Pacific Conference on Circuits and Systems 2006, APCCAS 2006, Singapore, 4-7 December 2006, pp. 1333-1336, 2006, IEEE, 1-4244-0387-1. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
|
27 | Till Tantau |
Towards a Cardinality Theorem for Finite Automata. ![Search on Bibsonomy](Pics/bibsonomy.png) |
MFCS ![In: Mathematical Foundations of Computer Science 2002, 27th International Symposium, MFCS 2002, Warsaw, Poland, August 26-30, 2002, Proceedings, pp. 625-636, 2002, Springer, 3-540-44040-2. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
|
27 | Imre Bárány, Gyula Károlyi |
Problems and Results around the Erdös-Szekeres Convex Polygon Theorem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
JCDCG ![In: Discrete and Computational Geometry, Japanese Conference, JCDCG 2000, Tokyo, Japan, November, 22-25, 2000, Revised Papers, pp. 91-105, 2000, Springer, 3-540-42306-0. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP DOI BibTeX RDF |
|
27 | Gernot Stenz, Andreas Wolf 0005 |
Scheduling Methods for Parallel Automated Theorem Proving. ![Search on Bibsonomy](Pics/bibsonomy.png) |
AI ![In: Advances in Artificial Intelligence, 13th Biennial Conference of the Canadian Society for Computational Studies of Intelligence, AI 2000, Montréal, Quebec, Canada, May 14-17, 2000, Proceedings, pp. 254-266, 2000, Springer, 3-540-67557-4. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP DOI BibTeX RDF |
|
27 | Jörg Desel |
A Proof of the Rank Theorem for Extended Free Choice Nets. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Application and Theory of Petri Nets ![In: Application and Theory of Petri Nets 1992, 13th International Conference, Sheffield, UK, June 22-26, 1992, Proceedings, pp. 134-153, 1992, Springer, 3-540-55676-1. The full citation details ...](Pics/full.jpeg) |
1992 |
DBLP DOI BibTeX RDF |
free choice nets - analysis, structure and behaviour of nets |
27 | Larry Wos |
Solving Open Questions with an Automated Theorem-Proving Program. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CADE ![In: 6th Conference on Automated Deduction, New York, USA, June 7-9, 1982, Proceedings, pp. 1-31, 1982, Springer, 3-540-11558-7. The full citation details ...](Pics/full.jpeg) |
1982 |
DBLP DOI BibTeX RDF |
|
27 | Bernard A. Galler, D. P. Rozenberg |
A Generalization of a Theorem of Carr on Error Bounds for Rung-Kutta Procedures. ![Search on Bibsonomy](Pics/bibsonomy.png) |
J. ACM ![In: J. ACM 7(1), pp. 57-60, 1960. The full citation details ...](Pics/full.jpeg) |
1960 |
DBLP DOI BibTeX RDF |
|
27 | Nobuyuki Sakamoto, Keita Yokoyama |
The Jordan curve theorem and the Schönflies theorem in weak second-order arithmetic. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Arch. Math. Log. ![In: Arch. Math. Log. 46(5-6), pp. 465-480, 2007. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
Mathematics Subject Classification (2000) Primary 03B30, Secondary 03F35, 26E35 |
27 | Radomir S. Stankovic, Jaakko Astola |
Reading the Sampling Theorem in Multiple-Valued Logic: A Journey from the (Shannong) Sampling Theorem to the Shannon Decomposition Rule. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISMVL ![In: 37th International Symposium on Multiple-Valued Logic, ISMVL 2007, 13-16 May 2007, Oslo, Norway, pp. 2, 2007, IEEE Computer Society, 978-0-7695-2831-1. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
|
27 | Chun Zhao, Ping Zhao 0004 |
Sampling theorem and irregular sampling theorem for multiwavelet subspaces. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Signal Process. ![In: IEEE Trans. Signal Process. 53(2-1), pp. 705-713, 2005. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
27 | R. E. Hodel |
Restricted versions of the Tukey-Teichmüller theorem that are equivalent to the Boolean prime ideal theorem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Arch. Math. Log. ![In: Arch. Math. Log. 44(4), pp. 459-472, 2005. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
|
27 | Ruben Gamboa, John R. Cowles |
A Mechanical Proof of the Cook-Levin Theorem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
TPHOLs ![In: Theorem Proving in Higher Order Logics, 17th International Conference, TPHOLs 2004, Park City, Utah, USA, September 14-17, 2004, Proceedings, pp. 99-116, 2004, Springer, 3-540-23017-3. The full citation details ...](Pics/full.jpeg) |
2004 |
DBLP DOI BibTeX RDF |
|
27 | Christophe Dehlinger, Jean-François Dufourd |
Formalizing the Trading Theorem for the Classification of Surfaces. ![Search on Bibsonomy](Pics/bibsonomy.png) |
TPHOLs ![In: Theorem Proving in Higher Order Logics, 15th International Conference, TPHOLs 2002, Hampton, VA, USA, August 20-23, 2002, Proceedings, pp. 148-163, 2002, Springer, 3-540-44039-9. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
|
27 | Mark D. Aagaard, Robert B. Jones, Carl-Johan H. Seger |
Lifted-FL: A Pragmatic Implementation of Combined Model Checking and Theorem Proving. ![Search on Bibsonomy](Pics/bibsonomy.png) |
TPHOLs ![In: Theorem Proving in Higher Order Logics, 12th International Conference, TPHOLs'99, Nice, France, September, 1999, Proceedings, pp. 323-340, 1999, Springer, 3-540-66463-7. The full citation details ...](Pics/full.jpeg) |
1999 |
DBLP DOI BibTeX RDF |
|
27 | Naren Narasimhan, Ranga Vemuri |
On the Effectiveness of Theorem Proving Guided Discovery of Formal Assertions for a Register Allocator in a High-Level Synthesis System. ![Search on Bibsonomy](Pics/bibsonomy.png) |
TPHOLs ![In: Theorem Proving in Higher Order Logics, 11th International Conference, TPHOLs'98, Canberra, Australia, September 27 - October 1, 1998, Proceedings, pp. 367-386, 1998, Springer, 3-540-64987-5. The full citation details ...](Pics/full.jpeg) |
1998 |
DBLP DOI BibTeX RDF |
|
26 | Yves Bertot, Vladimir Komendantsky |
Fixed point semantics and partial recursion in Coq. ![Search on Bibsonomy](Pics/bibsonomy.png) |
PPDP ![In: Proceedings of the 10th International ACM SIGPLAN Conference on Principles and Practice of Declarative Programming, July 15-17, 2008, Valencia, Spain, pp. 89-96, 2008, ACM, 978-1-60558-117-0. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
least fixed point semantics, non-terminating functions, program extraction, the Knaster-Tarski theorem, automated theorem proving |
26 | Guillaume Bonfante, Matthieu Kaczmarek, Jean-Yves Marion |
A Classification of Viruses Through Recursion Theorems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CiE ![In: Computation and Logic in the Real World, Third Conference on Computability in Europe, CiE 2007, Siena, Italy, June 18-23, 2007, Proceedings, pp. 73-82, 2007, Springer, 978-3-540-73000-2. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
iteration theorem, polymorphism, propagation, Computer viruses, recursion theorem |
26 | Gunther Schmidt 0001 |
Homomorphism and Isomorphism Theorems Generalized from a Relational Perspective. ![Search on Bibsonomy](Pics/bibsonomy.png) |
RelMiCS ![In: Relations and Kleene Algebra in Computer Science, 9th International Conference on Relational Methods in Computer Science and 4th International Workshop on Applications of Kleene Algebra, RelMiCS/AKA 2006, Manchester, UK, August 29-September 2, 2006, Proceedings, pp. 328-342, 2006, Springer, 3-540-37873-1. The full citation details ...](Pics/full.jpeg) |
2006 |
DBLP DOI BibTeX RDF |
homomorphism theorem, isomorphism theorem, multi-covering, relation algebra, congruence |
26 | Wendy MacCaull |
Finite Algebraic Models for Residuated Logic. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISMVL ![In: 25th IEEE International Symposium on Multiple-Valued Logic, ISMVL 1995, Bloomington, Indiana, USA, May 23-25, 1995, Proceedings, pp. 206-215, 1995, IEEE Computer Society, 0-8186-7118-1. The full citation details ...](Pics/full.jpeg) |
1995 |
DBLP DOI BibTeX RDF |
finite algebraic models, residuated logic, model pruning, nonclassical logics, combinatorial explosions, structure theorems, residuated algebras, theorem proving, inference mechanisms, search problems, multivalued logic, approximate reasoning, substructural logics, algebraic semantics, automated theorem prover |
26 | Zengtai Gong, Yabin Shao |
The Decomposition and Representation Theorem of Rough Fuzzy Set. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISIP ![In: International Symposium on Information Processing, ISIP 2008 / International Pacific Workshop on Web Mining, and Web-Based Application, WMWA 2008, Moscow, Russia, 23-25 May 2008, pp. 192-196, 2008, IEEE Computer Society, 978-0-7695-3151-9. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
Nested sets, Representation theorem, Rough fuzzy set, Decomposition theorem |
26 | Jen-Ho Yang, Chin-Chen Chang 0001 |
Aryabhata Remainder Theorem for Moduli with Common Factors and Its Application in Information Protection Systems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IIH-MSP ![In: 4th International Conference on Intelligent Information Hiding and Multimedia Signal Processing (IIH-MSP 2008), Harbin, China, 15-17 August 2008, Proceedings, pp. 1379-1382, 2008, IEEE Computer Society, 978-0-7695-3278-3. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
Aryabhata Remainder Theorem, Information Protection Systems, Chinese Remainder Theorem |
26 | Ming-Yi Fang, Wen-Tsuen Chen |
Vectorization of a Generalized Procedure for Theorem Proving in Propositional Logic on Vector Computers. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IEEE Trans. Knowl. Data Eng. ![In: IEEE Trans. Knowl. Data Eng. 4(5), pp. 475-486, 1992. The full citation details ...](Pics/full.jpeg) |
1992 |
DBLP DOI BibTeX RDF |
artificial intelligence, theorem proving, theorem proving, formal logic, propositional logic, vector processor systems, vectorisation, vector computers, deduction rules |
26 | A. Wolinsky |
A simple proof of Lewin's ordered-retrieval theorem for associative memories. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Commun. ACM ![In: Commun. ACM 11(7), pp. 488-490, 1968. The full citation details ...](Pics/full.jpeg) |
1968 |
DBLP DOI BibTeX RDF |
access frequency proof, column digit values, column sensing arrangement, digit value readout, digit value variety, digit variety readout, memory access frequency, ordered information retrieval, ordered lists, ordered retrieval efficiency, ordered retrieval theorem, retrieval theorem proof, associative memories, content-addressed memories, memory access |
25 | Anduo Wang, Prithwish Basu, Boon Thau Loo, Oleg Sokolsky |
Declarative Network Verification. ![Search on Bibsonomy](Pics/bibsonomy.png) |
PADL ![In: Practical Aspects of Declarative Languages, 11th International Symposium, PADL 2009, Savannah, GA, USA, January 19-20, 2009. Proceedings, pp. 61-75, 2009, Springer, 978-3-540-92994-9. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
network protocol verification, theorem proving, domain-specific languages, Declarative networking |
25 | Giulio Manzonetto, Antonino Salibra |
From lambda-Calculus to Universal Algebra and Back. ![Search on Bibsonomy](Pics/bibsonomy.png) |
MFCS ![In: Mathematical Foundations of Computer Science 2008, 33rd International Symposium, MFCS 2008, Torun, Poland, August 25-29, 2008, Proceedings, pp. 479-490, 2008, Springer, 978-3-540-85237-7. The full citation details ...](Pics/full.jpeg) |
2008 |
DBLP DOI BibTeX RDF |
Church Algebras, Stone Representation Theorem, Lambda Theories, Lambda calculus, Universal Algebra |
25 | Antonio Di Nola, Mirko Navara |
MV-Algebras with the Cantor-Bernstein Property. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IFSA (2) ![In: Theoretical Advances and Applications of Fuzzy Logic and Soft Computing, Selection of Papers from IFSA 2007, pp. 861-868, 2007, Springer, 978-3-540-72433-9. The full citation details ...](Pics/full.jpeg) |
2007 |
DBLP DOI BibTeX RDF |
Cantor-Bernstein theorem, boolean element of an MV-algebra, partition of unity, direct product decomposition, ?-complete MV-algebra, multiplicative MV-algebra, MV-algebra |
25 | Ren Ng |
Fourier slice photography. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ACM Trans. Graph. ![In: ACM Trans. Graph. 24(3), pp. 735-744, 2005. The full citation details ...](Pics/full.jpeg) |
2005 |
DBLP DOI BibTeX RDF |
digital refocusing, plenoptic camera, projection-slice theorem, fourier transform, digital photography |
25 | Kenichiro Tanabe |
A Criterion for Designs in {\tf="P101461" Z}_4-codes on the Symmetrized Weight Enumerator. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Des. Codes Cryptogr. ![In: Des. Codes Cryptogr. 30(2), pp. 169-185, 2003. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
Z 4-codes, Assmus-Mattson theorem, harmonic weight, enumerator |
25 | Yair Bartal, Nathan Linial, Manor Mendel, Assaf Naor |
On metric ramsey-type phenomena. ![Search on Bibsonomy](Pics/bibsonomy.png) |
STOC ![In: Proceedings of the 35th Annual ACM Symposium on Theory of Computing, June 9-11, 2003, San Diego, CA, USA, pp. 463-472, 2003, ACM, 1-58113-674-9. The full citation details ...](Pics/full.jpeg) |
2003 |
DBLP DOI BibTeX RDF |
Dvoretzky theorem, Ramsey theory, finite metric spaces |
25 | Haiyan Xiong, Paul Curzon, Sofiène Tahar, Ann Blandford |
Formally Linking MDG and HOL Based on a Verified MDG System. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IFM ![In: Integrated Formal Methods, Third International Conference, IFM 2002, Turku, Finland, May 15-18, 2002, Proceedings, pp. 205-224, 2002, Springer, 3-540-43703-7. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
hybrid verification systems, deductive theorem proving, symbolic state enumeration, usability verification, hardware verification |
25 | Herman Geuvers, Gueorgui I. Jojgov |
Open Proofs and Open Terms: A Basis for Interactive Logic. ![Search on Bibsonomy](Pics/bibsonomy.png) |
CSL ![In: Computer Science Logic, 16th International Workshop, CSL 2002, 11th Annual Conference of the EACSL, Edinburgh, Scotland, UK, September 22-25, 2002, Proceedings, pp. 537-552, 2002, Springer, 3-540-44240-5. The full citation details ...](Pics/full.jpeg) |
2002 |
DBLP DOI BibTeX RDF |
open terms, meta-variables, formulas-as-types, type theory, interactive theorem proving |
25 | David A. Plaisted |
Special Cases and Substitutes for Rigid E-Unification. ![Search on Bibsonomy](Pics/bibsonomy.png) |
Appl. Algebra Eng. Commun. Comput. ![In: Appl. Algebra Eng. Commun. Comput. 10(2), pp. 97-152, 2000. The full citation details ...](Pics/full.jpeg) |
2000 |
DBLP DOI BibTeX RDF |
Rigid E -unification, Theorem proving, First-order logic, Decidability, Unification, Equality, Horn clauses, Tableaux |
25 | Clemens Ballarin, Lawrence C. Paulson |
Reasoning About Coding Theory: The Benefits We Get from Computer Algebra. ![Search on Bibsonomy](Pics/bibsonomy.png) |
AISC ![In: Artificial Intelligence and Symbolic Computation, International Conference AISC'98, Plattsburgh, New York, USA, September 16-18, 1998, Proceedings, pp. 55-66, 1998, Springer, 3-540-64960-3. The full citation details ...](Pics/full.jpeg) |
1998 |
DBLP DOI BibTeX RDF |
mechanised reasoning, combining systems, soundness of computer algebra systems, specialisation problem, AISC topics, Integration of logical reasoning and computer algebra, Computer algebra, coding theory, automated theorem provers |
25 | B. Kutzler |
Careful Algebraic Translations of Geometry Theorems. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ISSAC ![In: Proceedings of the ACM-SIGSAM 1989 International Symposium on Symbolic and Algebraic Computation, ISSAC '89, Portland, Oregon, USA, July 17-19, 1989, pp. 254-263, 1989, ACM, 0-89791-325-6. The full citation details ...](Pics/full.jpeg) |
1989 |
DBLP DOI BibTeX RDF |
computational analytical geometry, automated geometry theorem proving |
25 | Yingying Jiang 0001, Feng Tian 0001, Hongan Wang, Xiaolong Zhang 0001, XuGang Wang, Guozhong Dai |
Intelligent understanding of handwritten geometry theorem proving. ![Search on Bibsonomy](Pics/bibsonomy.png) |
IUI ![In: Proceedings of the 15th International Conference on Intelligent User Interfaces, IUI 2010, Hong Kong, China, February 7-10, 2010, pp. 119-128, 2010, ACM, 978-1-60558-515-4. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP DOI BibTeX RDF |
geometry theorem proving, hand-drawn figures, hand-written proof scripts, structure based manipulation, recognition |
25 | Eric A. Brewer |
A certain freedom: thoughts on the CAP theorem. ![Search on Bibsonomy](Pics/bibsonomy.png) |
PODC ![In: Proceedings of the 29th Annual ACM Symposium on Principles of Distributed Computing, PODC 2010, Zurich, Switzerland, July 25-28, 2010, pp. 335, 2010, ACM, 978-1-60558-888-9. The full citation details ...](Pics/full.jpeg) |
2010 |
DBLP DOI BibTeX RDF |
cap theorem |
25 | Jie Zhou, Yong-hao Ou |
Key Tree and Chinese Remainder Theorem Based Group Key Distribution Scheme. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICA3PP ![In: Algorithms and Architectures for Parallel Processing, 9th International Conference, ICA3PP 2009, Taipei, Taiwan, June 8-11, 2009. Proceedings, pp. 254-265, 2009, Springer, 978-3-642-03094-9. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
Group Key Distribution Scheme, Key tree, Group member subtree, root ID algorithm, Chinese Remainder Theorem |
25 | Chung C. Chang, Hsueh-Ming Lu |
A Medical Diagnosis Decision Support System Based on Bayesian Theorem and Web Services. ![Search on Bibsonomy](Pics/bibsonomy.png) |
ICA3PP ![In: Algorithms and Architectures for Parallel Processing, 9th International Conference, ICA3PP 2009, Taipei, Taiwan, June 8-11, 2009. Proceedings, pp. 775-785, 2009, Springer, 978-3-642-03094-9. The full citation details ...](Pics/full.jpeg) |
2009 |
DBLP DOI BibTeX RDF |
Bayesian theorem, web services, SOA, service-oriented architecture, medical decision support systems |
Displaying result #1 - #100 of 18348 (100 per page; Change: ) Pages: [ 1][ 2][ 3][ 4][ 5][ 6][ 7][ 8][ 9][ 10][ >>] |
|