利用ガイド
検索キーワード:(指定なし)
該当件数:112件
$Delta^p _2$Complete Lexicographically First
九大文献 <3107>
Completeness of Extended Unification Based on Basic Narrowing
九大文献 <3108>
SIGMA: A Text Database Management System
九大文献 <3109>
Pseudo Extension in Default Reasoning and Belief Revision by Model Inference
九大文献 <3110>
Parallel Complexity and P-Complete Problems
九大文献 <3112>
A Proof of the Correctness of Uratani's String Searching AIgorithm
九大文献 <3113>
The Lexicographically First Topologicai Order Problem is NLOG-Complete
九大文献 <3114>
A Parallel Algorithm for the Maximum 2-Chain Edge Packing Problem
九大文献 <3115>
A Fast Matching Algorithm for Patterns with Pictures
九大文献 <3117>
Elementary Formal System as a Logic Programming Language
九大文献 <3118>
Efficient Multiple String Replacing with Pictures
九大文献 <3119>
Elementary Formal System as a Unifying Framework for Language Learning
九大文献 <3120>
Query Processing for Structured Text as a Relation
九大文献 <3121>
A New Series of $Delta^{p}_{2}$ -Complete Problemse
九大文献 <3122>
A List of P-Complete Problems
九大文献 <3123>
Time-Bounded Reasoning in First Order Knowledge Base Systems
九大文献 <3126>
Inductive Inference from Positive Data is Powerful
九大文献 <3127>
Completeness of Depth-Bounded Resolution for Weakly Reducing Programs
九大文献 <3128>
A Foundation of Algorithmic Teaching
九大文献 <3129>
Decision Problems for the Intuitionistic Logic without Weakening Rule
九大文献 <3130>
Systematized Approaches to the Complexity of Subgraph Problems
九大文献 <3132>
Teachability in Computational Learning
九大文献 <3133>
Bounded Degree Maximal Subgraph Problems are in NC
九大文献 <3134>
Correct Definition of Finite Elasticity
九大文献 <3136>
Inductive Inference of Monotonic Formal Systems from Positive Data
九大文献 <3137>
On Maximum Uniform Partition of Line Graphs
九大文献 <3140>
A Completeness Theorem for Polynomial-Time Local Search Problems
九大文献 <3141>
O(log*n) Time Parallel Algorithm for Computing Bounded Degree Maximal Subgraphs
九大文献 <3142>
Using Maximal Independent Sets to Solve Problems in Parallel
九大文献 <3143>
Learning Elementary Formal Systems and an Application to Discovering Motifs in Proteins
九大文献 <3144>
Which Classes of Elementary Formal Systems Are Polynomial-Time Learnable?
九大文献 <7165057>
Analogy is NP-Hard
九大文献 <3145>
A Learning Algorithm for Elementary Formal Systems and its Experiments on Identification of Transmembrane Domains
九大文献 <3147>
Characterization of Pattern Languages
九大文献 <3148>
Relational Graph Rewritings
九大文献 <3060>
Polynomial Time Inference of Unions of Tree Pattern Languages
九大文献 <3149>
A Machine Discovery from Amino Acid Sequences by Decision Trees over Regular Patterns
九大文献 <3150>
A Simple Method of Mutual Translation between Japanese Sentences and Horn Clauses
九大文献 <3151>
A P-Complete Language Describable with Iterated Shuffle
九大文献 <3152>
Balanced Formulas, Minimal Formulas and Their Proofs
九大文献 <3154>
Degree-Two Formulas and Their Proofs
九大文献 <3157>
Sub-extensions in the Default Knowledge Base Systems
九大文献 <3155>
Inferring a Tree from Walks
九大文献 <3156>
Definite Inductive Inference as a Successful Identification Criterion
九大文献 <3158>
A graph structure over the category of sets and partial functions
九大文献 <3061>
Period lengths of cellular automata on square lattices with Rule 90
九大文献 <3062>
More about Learning Elementary Formal Systems
九大文献 <3159>
Algorithmic Learning Theory with Elementary Formal Systems
九大文献 <3160>
Inductive Inference with Bounded Mind Changes
九大文献 <3161>
Parallel Algorithms for Refutation Tree Problem on Formal Graph Systems
九大文献 <3162>