论文列表及评分结果

Using Tactics to Reformulate Formulae for Resolution Theorem Proving.

电商所评分:9

点击查看评分详情!

On Resolution with Short Clauses.

电商所评分:9

点击查看评分详情!

Unification in Sort Theories and Its Applications.

电商所评分:9

点击查看评分详情!

Ordinals I: Basic Notions.

电商所评分:6

点击查看评分详情!

Ordinals II: Some Applications and a Functorial Approach.

电商所评分:1

点击查看评分详情!

Formal Power Series.

电商所评分:9

点击查看评分详情!

Polynomial Time Uniformization and Non-standard Methods.

电商所评分:1

点击查看评分详情!

Back and Forth between Continuous and Discrete for the Working Computer Scientist.

电商所评分:7

点击查看评分详情!

Some Artefacts of Integer-computer Circles.

电商所评分:2

点击查看评分详情!

Sorting, Linear Time and the Satisfiability Problem.

电商所评分:10

点击查看评分详情!

Exact Complexity of Problems of Incompletely Specified Automata.

电商所评分:10

点击查看评分详情!

Massively Parallel Computations on Many-variable Polynomials.

电商所评分:3

点击查看评分详情!

Computations on One Dimensional Cellular Automata.

电商所评分:1

点击查看评分详情!

Definability, Decidability, Complexity.

电商所评分:8

点击查看评分详情!

Logic, Semigroups and Automata on Words.

电商所评分:5

点击查看评分详情!

A Unary Representation Result for System T.

电商所评分:10

点击查看评分详情!

About Classical Logic and Imperative Programming.

电商所评分:6

点击查看评分详情!

Learning-Theoretic Perspectives of Acceptable Numberings.

电商所评分:8

点击查看评分详情!

Intelligent Backtracking in CLP(R).

电商所评分:1

点击查看评分详情!

Seminormal Stratified Default Theories.

电商所评分:3

点击查看评分详情!

Program Tactics and Logic Tactics.

电商所评分:8

点击查看评分详情!

Polynomial-Time Computable Stable Models.

电商所评分:3

点击查看评分详情!

A Modal Contrastive Logic: The Logic of 'but'.

电商所评分:10

点击查看评分详情!

A BDD SAT Solver for Satisfiability Testing: An Industrial Case Study.

电商所评分:10

点击查看评分详情!

Hierarchies of Polynomially Solvable Satisfiability Problems.

电商所评分:9

点击查看评分详情!

A Cost Effective Question-Asking Strategy for Horn Clause Systems.

电商所评分:6

点击查看评分详情!

A Fast Parallel SAT-Solver - Efficient Workload Balancing.

电商所评分:3

点击查看评分详情!

On Computing Minimal Models.

电商所评分:5

点击查看评分详情!

On the complexity of Entailment in Propositional Multivalued Logics.

电商所评分:8

点击查看评分详情!

The Complexity of Minimum Partial Truth Assignments and Implication in Negation-Free Formulae.

电商所评分:1

点击查看评分详情!