標題: Titlebook: Logic Programming and Nonmonotonic Reasoning; 5th International Co Michael Gelfond,Nicola Leone,Gerald Pfeifer Conference proceedings 1999 [打印本頁] 作者: charity 時間: 2025-3-21 17:56
書目名稱Logic Programming and Nonmonotonic Reasoning影響因子(影響力)
書目名稱Logic Programming and Nonmonotonic Reasoning影響因子(影響力)學科排名
書目名稱Logic Programming and Nonmonotonic Reasoning網(wǎng)絡(luò)公開度
書目名稱Logic Programming and Nonmonotonic Reasoning網(wǎng)絡(luò)公開度學科排名
書目名稱Logic Programming and Nonmonotonic Reasoning被引頻次
書目名稱Logic Programming and Nonmonotonic Reasoning被引頻次學科排名
書目名稱Logic Programming and Nonmonotonic Reasoning年度引用
書目名稱Logic Programming and Nonmonotonic Reasoning年度引用學科排名
書目名稱Logic Programming and Nonmonotonic Reasoning讀者反饋
書目名稱Logic Programming and Nonmonotonic Reasoning讀者反饋學科排名
作者: 親屬 時間: 2025-3-21 20:14
Belief, Knowledge, Revisions, and a Semantics of Non-Monotonic Reasoningerefore they enable to define a semantics of insertions to and revisions of AELKB-theories. A computation of the transformations (between possible worlds) is based on (an enhanced) model-checking. The transformations may be used as a method of computing static autoepistemic expansions.作者: PRISE 時間: 2025-3-22 02:40
From Causal Theories to Logic Programs (Sometimes) to the one given in [.,.]. Our main result is a theorem that shows how action precondition and fully instantiated successor state axioms can be computed from the answer sets of the translated logic program.作者: 粗糙濫制 時間: 2025-3-22 04:52
Pushing Goal Derivation in DLP Computationsg and diagnosis, or implicitly in the form of integrity constraints). This way, a lot of useless models are discarded “a priori” and the computation converges rapidly toward the generation of the “right” answer set. A few preliminary benchmarks show dramatic efficiency gains due to the new techniques.作者: labile 時間: 2025-3-22 10:30 作者: Abrupt 時間: 2025-3-22 16:14
On the Role of Negation in Choice Logic Programsa program. Based on an intuitive notion of unfounded set for choice programs, we show that several results from (seminegative) disjunctive programs can be strengthened; characterizing the position of choice programs as an intermediate between simple positive programs and programs that allow for the explicit use of negation in the body of a rule.作者: 改進 時間: 2025-3-22 19:28
Fixed-Parameter Complexity in AI and Nonmonotonic Reasoningt circumscriptive inference from a general propositional theory, when the attention is restricted to models of bounded size, is fixed-parameter intractable and is actually complete for a novel fixed-parameter complexity class.作者: MIRTH 時間: 2025-3-22 21:20
Annotated Revision Programsn of a model of a program and we change the notion of a justified revision. We show that under this new approach fundamental properties of justified revisions of standard revision programs extend to the case of annotated revision programs.作者: Decrepit 時間: 2025-3-23 03:50
Linear Tabulated Resolution for the Well-Founded Semanticsemantics, which resolves the problems of infinite loops and redundant computations while preserving the linearity. For non-floundering queries, the proposed method is sound and complete for general logic programs with the bounded-term-size property.作者: affect 時間: 2025-3-23 07:24 作者: 載貨清單 時間: 2025-3-23 09:43 作者: entice 時間: 2025-3-23 17:54
Representing Transition Systems by Logic Programsnswer set semantics, without mentioning causal theories. The translations from . into logic programming that we investigate serve as a basis for the use of systems for computing answer sets to reason about action domains described in . and to generate plans in such domains.作者: 你不公正 時間: 2025-3-23 20:07 作者: construct 時間: 2025-3-24 01:51 作者: 易碎 時間: 2025-3-24 05:02
Douglas Cenzer,Jeffrey B. Remmel,Amy Vanderbiltdesdeutschen Familienpolitik vollzogen. Davon ausgehend, dass der konservativ- korporatistische Wohlfahrtsstaat nur noch unzureichende Antworten auf soziale, demographische und ?konomische Wandlungsprozesse in der Gesellschaft bietet, setzte sich zusehends das Konzept eines ?aktivierenden Staates“ o作者: 職業(yè)拳擊手 時間: 2025-3-24 10:14 作者: ICLE 時間: 2025-3-24 13:56 作者: Cardiac 時間: 2025-3-24 17:05
Antonis Kakas,Rob Miller,Francesca Tonidesdeutschen Familienpolitik vollzogen. Davon ausgehend, dass der konservativ- korporatistische Wohlfahrtsstaat nur noch unzureichende Antworten auf soziale, demographische und ?konomische Wandlungsprozesse in der Gesellschaft bietet, setzte sich zusehends das Konzept eines ?aktivierenden Staates“ o作者: acetylcholine 時間: 2025-3-24 22:21
Vladimir Lifschitz,Hudson Turnerdesdeutschen Familienpolitik vollzogen. Davon ausgehend, dass der konservativ- korporatistische Wohlfahrtsstaat nur noch unzureichende Antworten auf soziale, demographische und ?konomische Wandlungsprozesse in der Gesellschaft bietet, setzte sich zusehends das Konzept eines ?aktivierenden Staates“ o作者: BIDE 時間: 2025-3-25 02:04 作者: 溫和女孩 時間: 2025-3-25 05:15 作者: GRAVE 時間: 2025-3-25 08:31 作者: animated 時間: 2025-3-25 14:17
Locally Determined Logic Programserode, and Remmel [.] that there exists finite predicate logic programs and recursive propositional logic programs which have stable models but no hyperarithmetic stable models. In this paper, we shall define several conditions which ensure that recursive logic program has a stable model which is re作者: 燈泡 時間: 2025-3-25 16:10
Annotated Revision ProgramsFitting who assigned annotations to revision atoms. Annotations provide a way to quantify certainty (likelihood) that a revision atom holds. The main goal of our paper is to reexamine the work of Fitting, argue that his semantics does not always provide results consistent with intuition and to propo作者: LAST 時間: 2025-3-25 20:55 作者: 不自然 時間: 2025-3-26 03:03
An Argumentation Framework for Reasoning about Actions and Changeinto the argumentation framework of Logic Programming without Negation as Failure (LPwNF). This translation enables us 1) to understand default persistence as captured by various temporal reasoning frameworks in a simple and natural way, by assigning higher priority to information about effects of l作者: GLIB 時間: 2025-3-26 07:45
Representing Transition Systems by Logic Programsheories and with action language ..We show here that many of the ideas developed in that work can be formulated in terms of logic programs under the answer set semantics, without mentioning causal theories. The translations from . into logic programming that we investigate serve as a basis for the u作者: 縮影 時間: 2025-3-26 11:20 作者: 引導 時間: 2025-3-26 15:22
From Causal Theories to Logic Programs (Sometimes)assical negation [.]. We found this translation interesting for at least the following two reasons: it provides a basis on which a wide class of causal theories in ([.]) can be computed; and it sheds some new lights on the nature of the causal theories in [.]. Our translation is in many ways similar作者: scrutiny 時間: 2025-3-26 20:26
Monotone Expansion of Updates in Logical Databasesation is proven to be a Σ..-complete problem. We define a class of operators expanding the input updates correctly with respect to the IC. The particular monotone expansion operator we describe is incrementally computed in square time. It provides a practical optimization of the standard complete ch作者: CHURL 時間: 2025-3-26 22:19
Updating Extended Logic Programs through Abductionre considered. We formulate these updates through abduction, and provide methods for computing them with .. An update program is an extended logic program which specifies changes on abductive hypotheses, then updates are computed by the . sets of an update program. The proposed technique provides a 作者: 增減字母法 時間: 2025-3-27 03:33
LUPS — A Language for Updating Logic Programswith time. To overcome this limitation, in a recent paper, the authors introduced the concept of .. There, they studied and defined the declarative and operational semantics of sequences of logic programs (or dynamic logic programs), P. ⊕...⊕P.. Each such program contains knowledge about some given 作者: figment 時間: 2025-3-27 06:03 作者: Multiple 時間: 2025-3-27 09:34
Linear Tabulated Resolution for the Well-Founded Semanticsrams. Global SLS-resolution is linear but suffers from infinite loops and redundant computations. In contrast, SLG-resolution resolves infinite loops and redundant computations by means of tabling, but it is not linear. The distinctive advantage of a linear approach is that it can be implemented usi作者: 濕潤 時間: 2025-3-27 16:21
A Case Study in Using Preference Logic Grammars for Knowledge Representationings and truncations, extraction of data via parsing, and correcting inconsistencies in extracted data. Prolog programming offers natural advantages for standardizing: definite clause grammars can be used to parse data; Prolog rules can be used to correct inconsistencies; and Prolog’s simple syntax 作者: Maximizer 時間: 2025-3-27 17:48
Minimal Founded Semantics for Disjunctive Logic Programmings stable model semantics for normal (i.e. non disjunctive) programs but differs from disjunctive stable model semantics (the extension of stable model semantics for disjunctive programs). Compared with disjunctive stable model semantics, the minimal founded semantics seems to be, in some case, more 作者: uveitis 時間: 2025-3-28 01:21 作者: Externalize 時間: 2025-3-28 04:19
Default Reasoning via Blocking Setsccomplish this by shifting the emphasis from the application of individual default rules to that of the . application of a default rule together with rules supporting this application. This allows for reasoning in an incremental yet compositional fashion, without giving up the expressiveness needed 作者: Immortal 時間: 2025-3-28 09:22
Coherent Well-founded Annotated Logic Programsve representation of knowledge. Extended logic programs add explicit negation to the default negation of normal programsin order to distinguish what can be shown to be false from what cannot be proven true. Annotated logic programs generalize the set of truth values over which a program is interpret作者: DEFER 時間: 2025-3-28 12:58 作者: HALO 時間: 2025-3-28 16:49 作者: 節(jié)省 時間: 2025-3-28 18:55 作者: 領(lǐng)先 時間: 2025-3-29 01:50 作者: 輕觸 時間: 2025-3-29 03:40 作者: 入伍儀式 時間: 2025-3-29 07:35
https://doi.org/10.1007/3-540-46767-XAutomated Deduction; Constraint Programming; Logic Programming; Nonclassical Logics; Nonmonotonic Reason作者: 枯萎將要 時間: 2025-3-29 11:24
978-3-540-66749-0Springer-Verlag Berlin Heidelberg 1999作者: 短程旅游 時間: 2025-3-29 15:37
Logic Programming and Nonmonotonic Reasoning978-3-540-46767-0Series ISSN 0302-9743 Series E-ISSN 1611-3349 作者: Hemoptysis 時間: 2025-3-29 23:11 作者: 意外的成功 時間: 2025-3-30 03:12 作者: allergy 時間: 2025-3-30 07:03
Victor Marek,Inna Pivkina,Miroslaw TruszczyńskiKritik kommt darüber hinaus mit dem Anspruch einer Gültigkeit daher, die einzelne Ma?nahmen und bestimmte analysierte Zeitr?ume übersteigt, mit dem Anspruch also, strukturelle Merkmale organisierter und professioneller Sorge um die Kinder zu erfassen.作者: ironic 時間: 2025-3-30 11:36 作者: 凹處 時間: 2025-3-30 15:18 作者: extract 時間: 2025-3-30 20:01 作者: Basal-Ganglia 時間: 2025-3-30 21:54 作者: 萬靈丹 時間: 2025-3-31 01:47
Michael Dekhtyar,Alexander Dikovsky,Sergey Dudakov,Nicolas Spyratos作者: reflection 時間: 2025-3-31 06:45
José Júlio Alferes,Luís Moniz Pereira,Halina Przymusinska,Teodor C. Przymusinski作者: 石墨 時間: 2025-3-31 10:33 作者: 善于 時間: 2025-3-31 15:18 作者: 美學 時間: 2025-3-31 21:05
LUPS — A Language for Updating Logic Programsin of actions, what are the appropriate sequences of programs that represent the performed actions and their effects? Whereas dynamic logic programming provides a way for determining what should follow, given the sequence of programs, it does not provide a good practical language for the specificati作者: 流出 時間: 2025-3-31 21:39 作者: subacute 時間: 2025-4-1 02:09 作者: 精美食品 時間: 2025-4-1 08:27
Einleitender überblick der Gründer der ., eingeführt; . verwendete 1658 der Arzt .. Die Methoden der Kryptographie machen eine Nachricht für den Unbefugten unlesbar, unverst?ndlich — ‘a(chǎn)rs .’. Im Deutschen spricht man auch von . (d.h. . als solche erkennbaren) ., engl. ..作者: 承認 時間: 2025-4-1 12:23 作者: Encephalitis 時間: 2025-4-1 14:56
