作者: 謙卑 時(shí)間: 2025-3-21 20:34
,‘Religion’ in the Popular Discourse,ied conditions, the WAM extension with an abstract notion of types is correct w.r.t. L. This is a first step towards our aim to provide a full specification and correctness proof of a concrete system, the PROTOS Abstract Machine (PAM), an extension of the WAM by polymorphic order-sorted unification 作者: 內(nèi)向者 時(shí)間: 2025-3-22 04:21 作者: carotenoids 時(shí)間: 2025-3-22 04:58 作者: Pseudoephedrine 時(shí)間: 2025-3-22 10:28 作者: Feedback 時(shí)間: 2025-3-22 13:30
https://doi.org/10.1007/978-1-349-10388-1own that each such procedure is preserved under isomorphism and thus determines an abstract procedure over ADTs. The main new feature of the g.r.t. developed here is that abstract computational procedures reduce to computational procedures in the ordinary sense when confined to data structures in a recursion-theoretic interpretation.作者: Feedback 時(shí)間: 2025-3-22 19:57
https://doi.org/10.1057/978-1-137-40281-3prove that this unit resolution algorithm is exponential in the number of atoms in the restricted set but is polynomial in the problem size when this number of fixed. We also survey a number of new satisfiability algorithms that have been suggested by the polyhedral interpretation of propositional logic.作者: 神經(jīng) 時(shí)間: 2025-3-23 01:04
,Fundamentals of Cation–π Interactions,e Ullman and van Gelder‘s approach and Plümer‘s method, no preprocessing is needed, and the approach works well even in the presence of mutual recursion. This approach has been used recently to show termination of the Prolog implementation of compiler for ProCoS level 0 language PL. developed at Oxford University.作者: 階層 時(shí)間: 2025-3-23 02:33
The Catholic Church and Unruly Women Writerst. We show that both soundness and completeness fail w.r.t. the denotational semantics and we present a natural restriction of rewriting that avoids unsoundness. We conjecture that this restricted rewriting is complete for computing denotation ally valid F.O. results.作者: IOTA 時(shí)間: 2025-3-23 08:59
Calculus of Residues and Distributions,tep towards such an abstract presentation. It enables the definition of connectives: each connective is defined by introduction rules only. It provides a nonmonotonic presentation of the Gentzen‘s consequence relation of classical logic. But, no representation theorem is known for Plausibility Logic and it does not enjoy Cut Elimination.作者: 催眠 時(shí)間: 2025-3-23 12:25 作者: DEBT 時(shí)間: 2025-3-23 15:38 作者: 愉快嗎 時(shí)間: 2025-3-23 19:52
Conference proceedings 1992, ordinal processes, persistentPetri nets, plausibility logic, program synthesissystems,quantifier hierarchies, semantics of modularization, stablelogic, term rewriting systems, termination of logicprograms,transitive closure logic, variants of resolution,and many others.作者: craven 時(shí)間: 2025-3-24 01:35
,‘Religion’ in the Popular Discourse,e power of formulas of arity 1 over strings define (classical) regular languages, to give a simpler equivalent of the L=NL open problem, and to establish the equivalence of the automata and formulas over grids.作者: MAIM 時(shí)間: 2025-3-24 06:19 作者: 使混合 時(shí)間: 2025-3-24 08:42
Mathematics and Its Applicationsof . is a model of ., whenever the partial order ≤ on . induced by + is complete, and + and · are Scott-continuous with respect to ≤. The family of all context-free languages over an alphabet of size n is the free structure for the class of submodels of continuous models of . in . generators.作者: Commemorate 時(shí)間: 2025-3-24 11:44
The expressive power of transitive closure and 2-way multihead automata,e power of formulas of arity 1 over strings define (classical) regular languages, to give a simpler equivalent of the L=NL open problem, and to establish the equivalence of the automata and formulas over grids.作者: Adulate 時(shí)間: 2025-3-24 15:54
Some aspects of the probabilistic behavior of variants of resolution, We show that there are typically short resolution proofs under unit/Davis-Putnam resolution for some models of formulas, and we study the “density” of rules necessary in another model for deriving the empty clause with probability tending to one.作者: 通知 時(shí)間: 2025-3-24 19:55
Towards Kleene Algebra with recursion,of . is a model of ., whenever the partial order ≤ on . induced by + is complete, and + and · are Scott-continuous with respect to ≤. The family of all context-free languages over an alphabet of size n is the free structure for the class of submodels of continuous models of . in . generators.作者: fibula 時(shí)間: 2025-3-25 02:06 作者: Duodenitis 時(shí)間: 2025-3-25 05:19
Tripta Jhang,Shweta Dwivedi,Sarika Sharma: We reduce the model checking problem to the problem of computing certain Parikh vectors, and we show that for the class of safe marked graphs these vectors can be computed — from the structure of the Petri net — in polynomial time in the size of the system.作者: 狗窩 時(shí)間: 2025-3-25 11:08 作者: 有斑點(diǎn) 時(shí)間: 2025-3-25 14:33
The Catholic Church and Unruly Women Writersterleaving universal quantifiers and TC-operators..It is also shown that transitive closure logic (and its fragments) have the same expressive power as the linear programs in certain extensions of Datalog.作者: 挑剔小責(zé) 時(shí)間: 2025-3-25 18:04 作者: 難聽(tīng)的聲音 時(shí)間: 2025-3-25 20:24
The cutting plane proof system with bounded degree of falsity,d show the results: This system .-simulates resolution and has polynomial size proofs for the pigeonhole formulas. The formulas from [ 9] only have superpolynomially long proofs in the system. Our system is the only known system with provably superpolynomial proof size, but polynomial size proofs for the pigeonhole formulas.作者: Mawkish 時(shí)間: 2025-3-26 03:02 作者: Phenothiazines 時(shí)間: 2025-3-26 07:33
Conference proceedings 1992is was the fifth in aseries of annual workshops on computer sciencelogic (thefirst four are recorded in LNCS volumes 329, 385, 440, and533).The volume contains 33 invited and selected papers on avariety of logical topics in computer science, includingabstract datatypes, bounded theories, complexity 作者: Rankle 時(shí)間: 2025-3-26 12:26
A new approach to abstract data types II computation on ADTs as ordinary computation,own that each such procedure is preserved under isomorphism and thus determines an abstract procedure over ADTs. The main new feature of the g.r.t. developed here is that abstract computational procedures reduce to computational procedures in the ordinary sense when confined to data structures in a recursion-theoretic interpretation.作者: 值得尊敬 時(shí)間: 2025-3-26 15:29 作者: 幼兒 時(shí)間: 2025-3-26 18:57
A transformational methodology for proving termination of logic programs,e Ullman and van Gelder‘s approach and Plümer‘s method, no preprocessing is needed, and the approach works well even in the presence of mutual recursion. This approach has been used recently to show termination of the Prolog implementation of compiler for ProCoS level 0 language PL. developed at Oxford University.作者: Costume 時(shí)間: 2025-3-26 22:20 作者: 上下連貫 時(shí)間: 2025-3-27 04:31 作者: Scintillations 時(shí)間: 2025-3-27 08:42 作者: 種屬關(guān)系 時(shí)間: 2025-3-27 09:52
A new approach to abstract data types II computation on ADTs as ordinary computation,sented in Part I of this paper. This is provided by a form of generalized recursion theory (g.r.t.) which uses schemata for explicit definition, conditional definition and least fixed point (LFP) recursion in partial functions and functionals of type level ≤2 over any appropriate structure. It is sh作者: AXIS 時(shí)間: 2025-3-27 16:29
The cutting plane proof system with bounded degree of falsity,on of formulas as systems of integer inequalities. We define a restriction of this system, the cutting plane system with bounded degree of falsity, and show the results: This system .-simulates resolution and has polynomial size proofs for the pigeonhole formulas. The formulas from [ 9] only have su作者: 潰爛 時(shí)間: 2025-3-27 21:36
Denotational versus declarative semantics for functional programming,bdomain. On the other hand, the usual . for logic programs is . (F.O.) and given by the least Herbrand model. In this paper, we take a restricted kind of H.O. conditional rewriting systems as computational paradigm for functional programming. For these systems, we define both H.O. denotational and F作者: 粗糙 時(shí)間: 2025-3-28 01:53 作者: 數(shù)量 時(shí)間: 2025-3-28 04:31 作者: 小卒 時(shí)間: 2025-3-28 09:48
Logical inference and polyhedral projection,tain a restricted set of atoms (i.e., all inferences that pertain to a given question) as a logical projection problem. We show that polyhedral projection partially solves this problem and in particular derives precisely those inferences that can be obtained by a certain form of unit resolution. We 作者: miniature 時(shí)間: 2025-3-28 12:42 作者: 淡紫色花 時(shí)間: 2025-3-28 18:27
A transformational methodology for proving termination of logic programs,oved that the termination of the derived rewriting system implies the termination of the corresponding logic program for well-moded queries under any selection rule implied by the given modings. The approach is mechanizable using termination orderings proposed in the term rewriting literature. Unlik作者: 流眼淚 時(shí)間: 2025-3-28 19:46
Plausibility logic,information. In [6], such properties were presented as families of binary relations between propositional formulas, i.e., built out of preexisting propositional logic. Though the family of cumulative relations is easily amenable to an abstract presentation that does not use the propositional connect作者: Extemporize 時(shí)間: 2025-3-29 02:44 作者: aerial 時(shí)間: 2025-3-29 03:34
Equational specification of abstract types and combinators,ions is given based on cofibrations of categories of algebras. It is shown that each equational type specification admits an initial model semantics, and we present complete inference systems for type assignments and equations.作者: Accessible 時(shí)間: 2025-3-29 08:45 作者: 潰爛 時(shí)間: 2025-3-29 13:08 作者: Dealing 時(shí)間: 2025-3-29 16:45 作者: 古老 時(shí)間: 2025-3-29 23:24 作者: GLUE 時(shí)間: 2025-3-30 02:35 作者: Obituary 時(shí)間: 2025-3-30 05:04 作者: Cardioplegia 時(shí)間: 2025-3-30 10:15
https://doi.org/10.1007/978-1-349-10388-1A subsystem of Kripke-Platek set theory proof-theoretically equivalent to primitive recursive arithmetic is isolated; Aczel‘s (relative) consistency argument for the Anti-Foundation Axiom is adapted to a (related) weak setting; and the logical complexity of the largest bisimulation is investigated.作者: 招募 時(shí)間: 2025-3-30 15:17
The Catholic Church and Unruly Women WritersWe define the class of syntactically safe queries in first order languages .. We prove using ideas from model theory that every model independent query is equivalent to a safe query. This answers a question raised by Topor in [Topor 1987].作者: Microgram 時(shí)間: 2025-3-30 18:56 作者: Adenoma 時(shí)間: 2025-3-30 21:21 作者: Neuropeptides 時(shí)間: 2025-3-31 02:16 作者: FISC 時(shí)間: 2025-3-31 06:03
Safe queries in relational databases with functions,We define the class of syntactically safe queries in first order languages .. We prove using ideas from model theory that every model independent query is equivalent to a safe query. This answers a question raised by Topor in [Topor 1987].作者: 孤獨(dú)無(wú)助 時(shí)間: 2025-3-31 09:16 作者: 正式通知 時(shí)間: 2025-3-31 13:22
,‘Religion’ in the Popular Discourse,Closure formulas is (non) deterministic log space [Ib73, Im88]. However, the subset of formulas needed to simulate exactly . heads is unknown. It is also unknown if the automata and formulas have the same expressive power over more general structures such as multidimensional grids. We define a reduc作者: 提名的名單 時(shí)間: 2025-3-31 18:12
,‘Religion’ in the Popular Discourse,ve its correctness. In this paper, we keep the notion of types and dynamic type constraints rather abstract to allow applications to different constraint formalisms like Prolog III or CLP(R). This generality permits us to introduce modular extensions of B?rger‘s and Rosenzweig‘s formal derivation of作者: 鋸齒狀 時(shí)間: 2025-4-1 01:28
Tripta Jhang,Shweta Dwivedi,Sarika Sharmat Petri nets; the logic is .., i.e. prepositional logic with a ‘some time’ operator. Our algorithm does not require to construct any transition system: We reduce the model checking problem to the problem of computing certain Parikh vectors, and we show that for the class of safe marked graphs these 作者: macabre 時(shí)間: 2025-4-1 03:41
