作者: 沙文主義 時間: 2025-3-21 21:56 作者: 憤怒歷史 時間: 2025-3-22 02:28 作者: Hemodialysis 時間: 2025-3-22 07:42 作者: 緩解 時間: 2025-3-22 10:29
The complexity of adaptive error-correcting codes,作者: Esophagus 時間: 2025-3-22 13:06 作者: Esophagus 時間: 2025-3-22 17:36
A formal operational semantics for languages of type Prolog III,f the standard Prolog algebras developed in [B?rger 1990]. In particular we show how our method can be used for a precise but simple method to handle specification problems connected to the freeze predicate.作者: ALIBI 時間: 2025-3-22 22:04
Efficiency considerations on goal-directed forward chaining for logic programs,ral but finite set of link clauses. We show that GDFC-resolution is sound and complete for definite programs. We discuss the efficiency of GDFC-resolution comparing it with SLD-resolution and present some experimental results.作者: fallible 時間: 2025-3-23 03:30 作者: 幸福愉悅感 時間: 2025-3-23 09:18 作者: 祖先 時間: 2025-3-23 10:52 作者: Sigmoidoscopy 時間: 2025-3-23 14:12 作者: perimenopause 時間: 2025-3-23 20:35 作者: 群居男女 時間: 2025-3-24 01:33 作者: cardiovascular 時間: 2025-3-24 05:55 作者: 強有力 時間: 2025-3-24 08:46 作者: 雄偉 時間: 2025-3-24 11:54 作者: 緊張過度 時間: 2025-3-24 15:48 作者: Malleable 時間: 2025-3-24 20:44 作者: Urgency 時間: 2025-3-25 02:58 作者: Flagging 時間: 2025-3-25 05:02 作者: Repetitions 時間: 2025-3-25 11:01
https://doi.org/10.1007/BFb0094072iency of tableau systems in the case of multiple-valued logics by introducing a generalized notion of signed formulas and give sound and complete tableau systems for arbitrary propositional finite-valued logics.作者: 芳香一點 時間: 2025-3-25 14:42 作者: OUTRE 時間: 2025-3-25 19:15 作者: ostrish 時間: 2025-3-25 21:23
A formal operational semantics for languages of type Prolog III,gic programming languages of type Prolog III [Colmerauer 1990]. Our specification abstracts away from any particular feature of the mechanism for the resolution of constraints, thus providing a uniform description of constraint logic programming languages which turns out to be a natural refinement o作者: NAG 時間: 2025-3-26 00:12
Efficiency considerations on goal-directed forward chaining for logic programs, refutations. GDFC-resolution focuses on relevant facts and rules by means of query independent link clauses. One problem is, that the number of link clauses may be infinite if the program contains recursive rules defined over recursive data structures. We present an approach to generate a more gene作者: JOG 時間: 2025-3-26 04:29 作者: 躲債 時間: 2025-3-26 08:45
A resolution variant deciding some classes of clause sets,mechanisms may be defined to provide decision algorithms for other interesting classes of clause sets. We shall inquire along this line of arguments into extensions of the Maslov class (i.e. the class of formulas with prefix of type ?*?* and at most two literals in each disjunct) in a forthcoming pa作者: Audiometry 時間: 2025-3-26 13:12 作者: 現(xiàn)暈光 時間: 2025-3-26 16:47 作者: 多余 時間: 2025-3-26 22:33
RAM with compact memory: a realistic and robust model of computation,inary or dyadic notation of integers). Let + and . respectively denote usual addition of integers and concatenation (of their dyadic notations). A RAM which uses only arithmetical operations of a set I is called an I - RAM. An LTTC-RAM is a RAM which only uses LTTC operations..In the present paper, 作者: AVID 時間: 2025-3-27 03:14
Towards an efficient tableau proof procedure for multiple-valued logics,ications, though they are highly intuitive and extremely flexible from a proof theoretical point of view. We present a method for increasing the efficiency of tableau systems in the case of multiple-valued logics by introducing a generalized notion of signed formulas and give sound and complete tabl作者: 放縱 時間: 2025-3-27 07:44 作者: Functional 時間: 2025-3-27 12:35
Logics for belief dependence,out their beliefs or knowledge. Several logics for belief dependence are introduced and studied. First of all, we try to formalize the problem of belief dependence in the framework of general epistemic logics, by which we will argue that general epistemic logic is not appropriate to formalize the pr作者: enumaerate 時間: 2025-3-27 17:05 作者: 燕麥 時間: 2025-3-27 20:14
https://doi.org/10.1007/3-540-54487-9Artificial Intelligence; Computational Complexity; Formal Languages; Formale Sprachen; Komplexit?t; Künst作者: 改變立場 時間: 2025-3-27 23:25
978-3-540-54487-6Springer-Verlag Berlin Heidelberg 1991作者: nitroglycerin 時間: 2025-3-28 05:56 作者: 漫步 時間: 2025-3-28 07:01
https://doi.org/10.1057/9781137432728mechanisms may be defined to provide decision algorithms for other interesting classes of clause sets. We shall inquire along this line of arguments into extensions of the Maslov class (i.e. the class of formulas with prefix of type ?*?* and at most two literals in each disjunct) in a forthcoming paper.作者: 中古 時間: 2025-3-28 13:04 作者: 禍害隱伏 時間: 2025-3-28 17:08
https://doi.org/10.1007/978-3-319-32088-5This is an attempt to simplify and justify the notions of deterministic and randomized reductions, an attempt to derive these notions from (more or less) first principles.作者: Anticoagulant 時間: 2025-3-28 19:37 作者: Vasodilation 時間: 2025-3-29 00:45
https://doi.org/10.1007/978-1-349-07780-9We present goal directed computation prcedures for classical, intuitionistic and linear implication. The procedure allows for using assumptions at most once. Completeness is proved and proof theoretic results such as interpolation are indicated作者: 非實體 時間: 2025-3-29 03:53 作者: accrete 時間: 2025-3-29 09:52
The Content of Computer Science,We shall show that the finite Ramsey theorem as a Δ. schema is provable in ..+Ω.. As a consequence we get that propositional formulas expressing the finite Ramsey theorem have polynomial-size bounded-depth Frege proofs.作者: 埋伏 時間: 2025-3-29 12:48
On the reduction theory for average case complexity,This is an attempt to simplify and justify the notions of deterministic and randomized reductions, an attempt to derive these notions from (more or less) first principles.作者: judicial 時間: 2025-3-29 17:02 作者: 陪審團(tuán)每個人 時間: 2025-3-29 23:07 作者: Nebulous 時間: 2025-3-30 03:47
Randomness and turing reducibility restraints,A definition of random sequences equivalent to the one of Martin-L?f and Schnorr motivated by the hierarchy of Turing reducibility restraints is introduced and compared with different similarily obtained notions.作者: RADE 時間: 2025-3-30 07:20
,Ramsey’s theorem in bounded arithmetic,We shall show that the finite Ramsey theorem as a Δ. schema is provable in ..+Ω.. As a consequence we get that propositional formulas expressing the finite Ramsey theorem have polynomial-size bounded-depth Frege proofs.作者: 軟弱 時間: 2025-3-30 11:16
A resolution variant deciding some classes of clause sets,mechanisms may be defined to provide decision algorithms for other interesting classes of clause sets. We shall inquire along this line of arguments into extensions of the Maslov class (i.e. the class of formulas with prefix of type ?*?* and at most two literals in each disjunct) in a forthcoming paper.作者: allergen 時間: 2025-3-30 13:45
Subclasses of quantified boolean formulas,ation problems for these classes are coNP-complete. These subclasses can be seen as extensions of Horn and 2-CNF formulas..Further it is shown that the evaluation problem for quantified CNF formulas remains PSPACE-complete, even if at most one universal variable is allowed in each clause.作者: 違法事實 時間: 2025-3-30 20:24
https://doi.org/10.1057/9780230620902s are given then they can be used to find an efficient membership test for such classes (see [Rob Sey 86b]). From these minors one can get a monadic second order description of the class .. Main result of the article is that from a monadic second order description of the class .. Main result of the 作者: 并排上下 時間: 2025-3-30 22:02
https://doi.org/10.1057/9781403973719gic programming languages of type Prolog III [Colmerauer 1990]. Our specification abstracts away from any particular feature of the mechanism for the resolution of constraints, thus providing a uniform description of constraint logic programming languages which turns out to be a natural refinement o作者: HEDGE 時間: 2025-3-31 03:46 作者: JUST 時間: 2025-3-31 08:35 作者: 事先無準(zhǔn)備 時間: 2025-3-31 09:22
https://doi.org/10.1057/9781137432728mechanisms may be defined to provide decision algorithms for other interesting classes of clause sets. We shall inquire along this line of arguments into extensions of the Maslov class (i.e. the class of formulas with prefix of type ?*?* and at most two literals in each disjunct) in a forthcoming pa作者: Antagonist 時間: 2025-3-31 14:28 作者: 尾巴 時間: 2025-3-31 21:14 作者: 外面 時間: 2025-3-31 22:37 作者: SSRIS 時間: 2025-4-1 04:01 作者: phlegm 時間: 2025-4-1 09:46
https://doi.org/10.1007/BFb0094072umber . of provers, number . of rounds and the value 1/. by which the error is bounded away from one half. In this denotation the class .(.) of languages accepted by ordinary IP-systems with . provers and . rounds appears as .(., 1/6), whereas we define .(.) to be the union of all .(., 1/.) with an 作者: intricacy 時間: 2025-4-1 12:43
,1847—Foundation and Founding Fathers,out their beliefs or knowledge. Several logics for belief dependence are introduced and studied. First of all, we try to formalize the problem of belief dependence in the framework of general epistemic logics, by which we will argue that general epistemic logic is not appropriate to formalize the pr作者: Adjourn 時間: 2025-4-1 14:26
