Jump to content

Search results

View (previous 20 | ) (20 | 50 | 100 | 250 | 500)
  • graph theory and finite model theory, the logic of graphs deals with formal specifications of graph properties using sentences of mathematical logic....
    40 KB (5,029 words) - 11:30, 25 October 2024
  • The Strange Logic of Random Graphs is a book on zero-one laws for random graphs. It was written by Joel Spencer and published in 2001 by Springer-Verlag...
    4 KB (551 words) - 02:35, 19 February 2025
  • Thumbnail for Existential graph
    existential graph is a type of diagrammatic or visual notation for logical expressions, created by Charles Sanders Peirce, who wrote on graphical logic as early...
    23 KB (2,957 words) - 20:29, 19 October 2024
  • Appendix:Glossary of graph theory in Wiktionary, the free dictionary. This is a glossary of graph theory. Graph theory is the study of graphs, systems of nodes...
    109 KB (16,011 words) - 18:32, 30 April 2025
  • Thumbnail for Conceptual graph
    formula in first-order logic (predicate calculus) is represented by a labeled graph. A linear notation, called the Conceptual Graph Interchange Format (CGIF)...
    6 KB (763 words) - 09:40, 13 July 2024
  • Thumbnail for Logic gate
    Logic level Logical graph Magnetic logic NMOS logic Parametron Processor design Programmable logic controller (PLC) Programmable logic device (PLD) Propositional...
    42 KB (3,649 words) - 13:35, 24 May 2025
  • Courcelle's theorem (category Graph algorithms)
    study of graph algorithms, Courcelle's theorem is the statement that every graph property definable in the monadic second-order logic of graphs can be decided...
    25 KB (3,146 words) - 20:27, 1 April 2025
  • repository of Common Logic Ontologies Hets supports Common Logic cltools is a PROLOG library with partial support for Common Logic Conceptual graph Knowledge Interchange...
    4 KB (456 words) - 04:48, 4 February 2024
  • cubic Hamiltonian graphs Logic of Computable Functions, a deductive system for computable functions, 1969 formalism by Dana Scott Logic for Computable Functions...
    1 KB (168 words) - 04:45, 20 January 2025
  • Conjunctive normal form Disjunctive normal form Formal system And-inverter graph Logic gate Boolean analysis Boolean prime ideal theorem Compactness theorem...
    6 KB (271 words) - 23:18, 23 July 2024
  • available, such as OrientDB, ArangoDB, and MarkLogic (starting with its 7.0 version). During this time, graph databases of various types have become especially...
    53 KB (4,714 words) - 22:02, 3 June 2025
  • Thumbnail for Rado graph
    In the mathematical field of graph theory, the Rado graph, Erdős–Rényi graph, or random graph is a countably infinite graph that can be constructed (with...
    38 KB (5,168 words) - 03:42, 24 August 2024
  • Thumbnail for Discrete mathematics
    Objects studied in discrete mathematics include integers, graphs, and statements in logic. By contrast, discrete mathematics excludes topics in "continuous...
    26 KB (2,771 words) - 14:34, 10 May 2025
  • nondeterministic constraint logic is a combinatorial system in which an orientation is given to the edges of a weighted undirected graph, subject to certain constraints...
    13 KB (1,691 words) - 22:08, 29 May 2025
  • Thumbnail for Knowledge graph
    knowledge graph is a knowledge base that uses a graph-structured data model or topology to represent and operate on data. Knowledge graphs are often used...
    21 KB (2,342 words) - 15:57, 24 May 2025
  • First-order logic, also called predicate logic, predicate calculus, or quantificational logic, is a collection of formal systems used in mathematics,...
    92 KB (12,932 words) - 13:50, 2 June 2025
  • Mathematical logic is the study of formal logic within mathematics. Major subareas include model theory, proof theory, set theory, and recursion theory...
    69 KB (8,370 words) - 19:50, 19 April 2025
  • important in the logic of graphs, because of Courcelle's theorem, which provides algorithms for evaluating monadic second-order formulas over graphs of bounded...
    11 KB (1,308 words) - 16:45, 18 April 2025
  • Progol (category Inductive logic programming)
    implementation of inductive logic programming that combines inverse entailment with general-to-specific search through a refinement graph. Inverse entailment...
    4 KB (384 words) - 04:51, 17 April 2025
  • Thumbnail for Directed acyclic graph
    In mathematics, particularly graph theory, and computer science, a directed acyclic graph (DAG) is a directed graph with no directed cycles. That is, it...
    45 KB (5,646 words) - 20:41, 12 May 2025
View (previous 20 | ) (20 | 50 | 100 | 250 | 500)