標(biāo)題: Titlebook: Logic for Programming, Artificial Intelligence, and Reasoning; 19th International C Ken McMillan,Aart Middeldorp,Andrei Voronkov Conference [打印本頁(yè)] 作者: Braggart 時(shí)間: 2025-3-21 16:32
書目名稱Logic for Programming, Artificial Intelligence, and Reasoning影響因子(影響力)
書目名稱Logic for Programming, Artificial Intelligence, and Reasoning影響因子(影響力)學(xué)科排名
書目名稱Logic for Programming, Artificial Intelligence, and Reasoning網(wǎng)絡(luò)公開(kāi)度
書目名稱Logic for Programming, Artificial Intelligence, and Reasoning網(wǎng)絡(luò)公開(kāi)度學(xué)科排名
書目名稱Logic for Programming, Artificial Intelligence, and Reasoning被引頻次
書目名稱Logic for Programming, Artificial Intelligence, and Reasoning被引頻次學(xué)科排名
書目名稱Logic for Programming, Artificial Intelligence, and Reasoning年度引用
書目名稱Logic for Programming, Artificial Intelligence, and Reasoning年度引用學(xué)科排名
書目名稱Logic for Programming, Artificial Intelligence, and Reasoning讀者反饋
書目名稱Logic for Programming, Artificial Intelligence, and Reasoning讀者反饋學(xué)科排名
作者: jocular 時(shí)間: 2025-3-21 20:31 作者: 不透氣 時(shí)間: 2025-3-22 02:38
Pablo Barceló,Gaelle Fontaine,Anthony Widjaja Linllen des Protagonisten zum uneingeschr?nkten Verstehen seiner selbst sowie an seinem inneren Gefühl, vor Gott und der Welt immer rechtens zu sein, zu einer Studie, die der hermeneutischen Forderung nach dem Verstehen sowohl auf der charakterlichen Ebene als auch auf der Ebene des Erz?hlens wahrhafti作者: 表示向前 時(shí)間: 2025-3-22 06:34
Peter Baumgartner,Joshua Baxllen des Protagonisten zum uneingeschr?nkten Verstehen seiner selbst sowie an seinem inneren Gefühl, vor Gott und der Welt immer rechtens zu sein, zu einer Studie, die der hermeneutischen Forderung nach dem Verstehen sowohl auf der charakterlichen Ebene als auch auf der Ebene des Erz?hlens wahrhafti作者: Range-Of-Motion 時(shí)間: 2025-3-22 10:03
Anton Belov,António Morgado,Joao Marques-Silvainer spezifisch romantischen Auspr?gung des ?konomiediskurses befassen. Doch wird der Begriff der ?konomie hier – wie in so vielen anderen literaturwissenschaftlichen Studien – leider ausschlie?lich metaphorisch, sprich: im übertragenen Sinne, verstanden und verwendet. Verbindendes Thema der hier ve作者: 飛鏢 時(shí)間: 2025-3-22 15:40 作者: 權(quán)宜之計(jì) 時(shí)間: 2025-3-22 19:37 作者: miniature 時(shí)間: 2025-3-23 00:39
Mélanie Boudard,Olivier Hermant, historische Ver?nderungen und natürlich ganz unterschiedliche Zielgruppen neue, andere Kleist-Bilder zustande – und wie wirken diese wiederum auf die Wahrnehmung des ursprünglichen kleistschen Werks zurück? Diesen Fragen stellte sich ein interdisziplin?rer Workshop, der am 19. und 20. Januar 2023 作者: foodstuff 時(shí)間: 2025-3-23 04:07
Filipe Casal,Jo?o Rasgatzten Gattungsbezeichnung ?(Eine Legende.)? separiert wurden. Dieser durch das Schriftbild visuell hervorgehobenen Konstellation wird bereits seit geraumer Zeit in der Forschung zu Kleists Erz?hlung nachgegangen, wobei im Hinblick auf sich wiederholende Stichw?rter wie etwa Ambivalenz oder Unentschi作者: 極肥胖 時(shí)間: 2025-3-23 06:04
Giovanni Casini,Umberto Stracciatzten Gattungsbezeichnung ?(Eine Legende.)? separiert wurden. Dieser durch das Schriftbild visuell hervorgehobenen Konstellation wird bereits seit geraumer Zeit in der Forschung zu Kleists Erz?hlung nachgegangen, wobei im Hinblick auf sich wiederholende Stichw?rter wie etwa Ambivalenz oder Unentschi作者: vanquish 時(shí)間: 2025-3-23 11:54 作者: Tractable 時(shí)間: 2025-3-23 15:32
Luís Cruz-Filipe,Rita Henriques,Isabel Nunes801 und 1804, w?hrend des ersten langen Exils von Preu?en, doch immer wieder angezogen hatte. Aber die Gef?ngnisse von Fort de Joux und dann Chalons-sur-Marne waren nun — im ersten Halbjahr 1807 — nicht das Paris von 1801 oder 1803/04. Man m?chte annehmen, da? die Gefangenschaft seine Phantasie mehr作者: heckle 時(shí)間: 2025-3-23 18:24
Ugo Dal Lago,Giulio Pellittaise geriet.. Dabei handelte es sich jedoch um eine Erkenntniskrise, um tiefgreifende Zweifel am Erkenntnispotential einer rationalistisch orientierten Aufkl?rungsphilosophie. Ausgesprochene kunst- oder literaturtheoretische Studien sind aus der Zeit bis 1801 noch nicht bekannt geworden.作者: Neolithic 時(shí)間: 2025-3-24 00:14
A Semantic Basis for Proof Queries and Transformations,d core for a hierarchical transformation language. Our study here is firmly in language design and semantics; implementation strategies and study of sub-languages of our query language with good complexity will come later.作者: Negligible 時(shí)間: 2025-3-24 05:01
SAT-Based Preprocessing for MaxSAT,certain clause elimination procedures are sound for MaxSAT, it is well-known that this is not the case for resolution and subsumption elimination. In this paper we show how to adapt these preprocessing techniques to MaxSAT. To achieve this we recast the MaxSAT problem in a recently introduced labell作者: evaculate 時(shí)間: 2025-3-24 07:03 作者: 滑動(dòng) 時(shí)間: 2025-3-24 13:55
A Seligman-Style Tableau System,on that branch. To the surprise of some of the authors (who have worked extensively on developing the labeling approach) Seligman-style inference is often clearer: not only is the approach more modular, individual proofs can be more direct. We briefly discuss termination and extensions to richer log作者: 臨時(shí)抱佛腳 時(shí)間: 2025-3-24 16:26
Multi-objective Discounted Reward Verification in Graphs and MDPs,e solved in polynomial time. For the reward-discount model we show that memory and randomisation of the strategies are required, but nevertheless that the problem is decidable and it is sufficient to consider strategies which after a certain number of steps behave in a memoryless way..For the genera作者: Chivalrous 時(shí)間: 2025-3-24 21:51
Luca Aceto,Dario Della Monica,Anna Ingólfsdóttir,Angelo Montanari,Guido Sciavicco作者: Robust 時(shí)間: 2025-3-25 00:01 作者: 發(fā)牢騷 時(shí)間: 2025-3-25 05:50
Josh Berdine,Nikolaj Bj?rner,Samin Ishtiaq,Jael E. Kriener,Christoph M. Wintersteiger作者: DECRY 時(shí)間: 2025-3-25 11:07
Patrick Blackburn,Thomas Bolander,Torben Braüner,Klaus Frovin J?rgensen作者: 大洪水 時(shí)間: 2025-3-25 12:49
Lecture Notes in Computer Sciencehttp://image.papertrans.cn/l/image/588012.jpg作者: 耐寒 時(shí)間: 2025-3-25 18:08
The Complexity of Clausal Fragments of LTL,of the available temporal operators and the structure of the clausal normal form of the temporal formulas. We determine the computational complexity of the satisfiability problem for each of the fragments, which ranges from . to ., NP and ..作者: MAIZE 時(shí)間: 2025-3-25 23:37
Resourceful Reachability as HORN-LA,context, we extract a reachability benchmark suite and evaluate methods for encoding reachability properties with heaps using Horn clauses over linear arithmetic. The benchmarks are particularly challenging and we describe and evaluate pre-processing transformations that are shown to have significant effect.作者: bizarre 時(shí)間: 2025-3-26 03:56
Tree Interpolation in Vampire,and can also be used to derive sequence interpolants. We evaluated our implementation on a large number of examples over the theory of linear integer arithmetic and integer-indexed arrays, with and without quantifiers. When compared to other methods, our experiments show that some examples could only be solved by our implementation.作者: jealousy 時(shí)間: 2025-3-26 04:18
Complexity Analysis in Presence of Control Operators and Higher-Order Functions,, the logic naturally gives rise to a type system for the .-calculus, whose derivations reveal bounds on the time complexity of the underlying term. This is the first example of a type system for the .-calculus guaranteeing time complexity bounds for typable programs.作者: floodgate 時(shí)間: 2025-3-26 10:41 作者: 搜尋 時(shí)間: 2025-3-26 14:52 作者: Hyperplasia 時(shí)間: 2025-3-26 19:23 作者: Forage飼料 時(shí)間: 2025-3-26 23:05
Logic for Programming, Artificial Intelligence, and Reasoning978-3-642-45221-5Series ISSN 0302-9743 Series E-ISSN 1611-3349 作者: Matrimony 時(shí)間: 2025-3-27 02:05 作者: ONYM 時(shí)間: 2025-3-27 08:25 作者: SEEK 時(shí)間: 2025-3-27 11:34 作者: Ruptured-Disk 時(shí)間: 2025-3-27 17:00 作者: 少量 時(shí)間: 2025-3-27 19:08
Revisiting the Equivalence of Shininess and Politeness,nd provide two different sufficient conditions for a strongly polite theory to be shiny. Based on these results, we derive a combination method for the union of a polite theory with an arbitrary theory.作者: amorphous 時(shí)間: 2025-3-28 01:06 作者: 擔(dān)心 時(shí)間: 2025-3-28 03:50 作者: heart-murmur 時(shí)間: 2025-3-28 06:46 作者: 斷斷續(xù)續(xù) 時(shí)間: 2025-3-28 11:51
Comparison of LTL to Deterministic Rabin Automata Translators,s construction and work on LTL fragments only. We compare performance and automata produced by the mentioned tools, where . is combined with several LTL to Büchi automata translators: besides traditionally used LTL2BA, we also consider LTL??>NBA, LTL3BA, and Spot.作者: 令人悲傷 時(shí)間: 2025-3-28 17:58 作者: Laconic 時(shí)間: 2025-3-28 22:03 作者: 不透明 時(shí)間: 2025-3-28 23:52 作者: 朦朧 時(shí)間: 2025-3-29 04:20
Conference proceedings 2013eld in December 2013 in Stellenbosch, South Africa. The 44 regular papers and 8 tool descriptions and experimental papers included in this volume were carefully reviewed and selected from 152 submissions. The series of International Conferences on Logic for Programming, Artificial Intelligence and R作者: 墊子 時(shí)間: 2025-3-29 09:17 作者: Creatinine-Test 時(shí)間: 2025-3-29 13:06
May-Happen-in-Parallel Analysis for Priority-Based Scheduling,information to detect data races, and also to infer more complex properties of concurrent programs, e.g., deadlock freeness, termination and resource consumption analyses can greatly benefit from the MHP relations to increase their accuracy. Previous MHP analyses have assumed a worst case scenario b作者: Trypsin 時(shí)間: 2025-3-29 16:28
The Complexity of Clausal Fragments of LTL,of the available temporal operators and the structure of the clausal normal form of the temporal formulas. We determine the computational complexity of the satisfiability problem for each of the fragments, which ranges from . to ., NP and ..作者: jocular 時(shí)間: 2025-3-29 23:34
A Semantic Basis for Proof Queries and Transformations,ng hierarchically nested labelled trees, which we claim is a natural way of taming the complexity of huge proofs. Query-driven updates allow us to change this structure, in particular, to transform proofs produced by interactive theorem provers into forms that are easier for humans to understand, or作者: Jubilation 時(shí)間: 2025-3-30 02:04 作者: Culmination 時(shí)間: 2025-3-30 06:12
Proving Infinite Satisfiability,f additional hypotheses over these data structures. We investigate a simple approach based on refutational theorem proving. We assume that the data structure axioms are satisfiable and provide a template language for additional hypotheses such that satisfiability is preserved. Then disproving is don作者: 意外 時(shí)間: 2025-3-30 11:40 作者: 疲憊的老馬 時(shí)間: 2025-3-30 15:17
Dynamic and Static Symmetry Breaking in Answer Set Programming,h program one of its canonical models. The stable models of a logic program are in a certain sens the minimal Herbrand models of its . programs. On the other hand, the notion of symmetry elimination had been widely studied in constraint programming and shown to be useful to increase the efficiency o作者: Mortar 時(shí)間: 2025-3-30 20:37 作者: BILL 時(shí)間: 2025-3-30 21:44 作者: ascetic 時(shí)間: 2025-3-31 01:44
A Seligman-Style Tableau System,ost resolution, natural deduction, and tableau systems for hybrid logic. But there is another, less well-known approach, which we have come to believe is conceptually clearer. We call this Seligman-style inference, as it was first introduced and explored by Jerry Seligman in the setting of natural d作者: 殘廢的火焰 時(shí)間: 2025-3-31 06:34
Comparison of LTL to Deterministic Rabin Automata Translators,e standard approach represented by . tool employs Safra’s construction to determinize a Büchi automaton produced by some LTL to Büchi automata translator. Since 2012, three new LTL to deterministic Rabin automata translators appeared, namely Rabinizer, LTL3DRA, and Rabinizer 2. They all avoid Safra’作者: Nmda-Receptor 時(shí)間: 2025-3-31 10:43 作者: 后退 時(shí)間: 2025-3-31 15:23
Polarizing Double-Negation Translations,mplify the translations and introduce fewer negations. To achieve this, we consider the polarization of the formul? and adapt those translation to the different connectives and quantifiers. We show that the embedding results still hold, using a customized version of the focused classical sequent cal作者: Arteriography 時(shí)間: 2025-3-31 19:25 作者: LOPE 時(shí)間: 2025-4-1 01:37
Multi-objective Discounted Reward Verification in Graphs and MDPs, a generalised version of discounted reward objectives, in which the amount of discounting depends on the states visited and on the objective. This definition extends the usual definition of discounted reward, and allows to capture the systems in which the value of different commodities diminish at 作者: 獨(dú)輪車 時(shí)間: 2025-4-1 02:00
Description Logics, Rules and Multi-context Systems,hieve this goal. In this paper, we look at two of these formalisms, Mdl-programs and multi-context systems, which address different aspects of this combination, and include different, incomparable programming constructs. Despite this, we show that every Mdl-program can be transformed in a multi-cont作者: infringe 時(shí)間: 2025-4-1 08:51 作者: 逃避現(xiàn)實(shí) 時(shí)間: 2025-4-1 12:56 作者: Frenetic 時(shí)間: 2025-4-1 17:54
