[go: up one dir, main page]

Suttner, 2005 - Google Patents

A parallel theorem prover with heuristic work distribution

Suttner, 2005

Document ID
4320878137837036649
Author
Suttner C
Publication year
Publication venue
Parallelization in Inference Systems: International Workshop Dagstuhl Castle, Germany, December 17–18, 1990 Proceedings

External Links

Snippet

PARTHEO is an OR-parallel theorem prover for first order predicate logic. The underlying calculus, the computational model, and the system architecture of the prover will be described. An important aspect of the parallel system is the distribution of work among …
Continue reading at link.springer.com (other versions)

Classifications

    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06N—COMPUTER SYSTEMS BASED ON SPECIFIC COMPUTATIONAL MODELS
    • G06N5/00—Computer systems utilising knowledge based models
    • G06N5/02—Knowledge representation
    • G06N5/022—Knowledge engineering, knowledge acquisition
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06F—ELECTRICAL DIGITAL DATA PROCESSING
    • G06F8/00—Arrangements for software engineering
    • G06F8/40—Transformations of program code
    • G06F8/41—Compilation
    • G06F8/42—Syntactic analysis
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06N—COMPUTER SYSTEMS BASED ON SPECIFIC COMPUTATIONAL MODELS
    • G06N5/00—Computer systems utilising knowledge based models
    • G06N5/04—Inference methods or devices
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06F—ELECTRICAL DIGITAL DATA PROCESSING
    • G06F9/00—Arrangements for programme control, e.g. control unit
    • G06F9/06—Arrangements for programme control, e.g. control unit using stored programme, i.e. using internal store of processing equipment to receive and retain programme
    • G06F9/46—Multiprogramming arrangements
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06N—COMPUTER SYSTEMS BASED ON SPECIFIC COMPUTATIONAL MODELS
    • G06N99/00—Subject matter not provided for in other groups of this subclass
    • G06N99/005—Learning machines, i.e. computer in which a programme is changed according to experience gained by the machine itself during a complete run
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06F—ELECTRICAL DIGITAL DATA PROCESSING
    • G06F17/00—Digital computing or data processing equipment or methods, specially adapted for specific functions
    • G06F17/30—Information retrieval; Database structures therefor; File system structures therefor
    • G06F17/30943—Information retrieval; Database structures therefor; File system structures therefor details of database functions independent of the retrieved data type
    • G06F17/30946—Information retrieval; Database structures therefor; File system structures therefor details of database functions independent of the retrieved data type indexing structures
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06F—ELECTRICAL DIGITAL DATA PROCESSING
    • G06F9/00—Arrangements for programme control, e.g. control unit
    • G06F9/06—Arrangements for programme control, e.g. control unit using stored programme, i.e. using internal store of processing equipment to receive and retain programme
    • G06F9/44—Arrangements for executing specific programmes
    • G06F9/4421—Execution paradigms
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06F—ELECTRICAL DIGITAL DATA PROCESSING
    • G06F8/00—Arrangements for software engineering
    • G06F8/30—Creation or generation of source code
    • G06F8/31—Programming languages or programming paradigms
    • G06F8/311—Functional or applicative languages; Rewrite languages
    • G—PHYSICS
    • G06—COMPUTING; CALCULATING; COUNTING
    • G06N—COMPUTER SYSTEMS BASED ON SPECIFIC COMPUTATIONAL MODELS
    • G06N7/00—Computer systems based on specific mathematical models
    • G06N7/005—Probabilistic networks

Similar Documents

Publication Publication Date Title
Guerreschi et al. Two-step approach to scheduling quantum circuits
Parr Hierarchical control and learning for Markov decision processes
Santos Jr et al. A framework for building knowledge-bases under uncertainty
Guerreschi et al. Gate scheduling for quantum algorithms
Lécué et al. Semantic and syntactic data flow in web service composition
Suttner A parallel theorem prover with heuristic work distribution
Anglano et al. NOW G-Net: learning classification programs on networks of workstations
Shimony et al. Exploiting case-based independence for approximating marginal probabilities
Fioretto et al. Exploiting GPUs in solving (distributed) constraint optimization problems with dynamic programming
Beierle et al. A complete map of conditional knowledge bases in different normal forms and their induced system P inference relations over small signatures
PISTORE et al. Modeling concurrent, mobile and coordinated systems via graph transformations
Gorti et al. Solving constraint satisfaction problems using ATeams
Costantini et al. Learning by Knowledge Exchange in Logical Agents.
Sato Generative modeling by PRISM
Pfanschilling et al. Sum-Product Loop Programming: From Probabilistic Circuits to Loop Programming.
Olmin On uncertainty quantification in neural networks: Ensemble distillation and weak supervision
Simari et al. Parallel abductive query answering in probabilistic logic programs
Samiullah et al. Automated construction of an object-oriented Bayesian network (OOBN) class hierarchy
Johansson Graph decomposition using node labels
Shati et al. Neural Sequence Generation with Constraints via Beam Search with Cuts: A Case Study on VRP
Hadjila et al. Flexible service discovery based on multiple matching algorithms
Muñoz-Hernández et al. Solving Collaborative Fuzzy Agents Problems with CLP ()
Nicolescu et al. Towards structured modelling with hyperdag P systems
Dovier et al. Set unification
Wiech OF TECHNOLOGY