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