In the present paper, resolution-based automatedreasoningtheory and algorithm in a finite chain lattice-valued proposition logic are focused. Concretely, the resolution principle, which is based on a finite chain la...
详细信息
In the present paper, resolution-based automatedreasoningtheory and algorithm in a finite chain lattice-valued proposition logic are focused. Concretely, the resolution principle, which is based on a finite chain lattice-valued propositional logic FCLP(X) is investigated. And soundness theorem and completeness theorem of this resolution principle are also proved. In order to realize resolution, the concrete algorithm of resolution is discussed. It is hoped that this research will make forward theoretical research of automatedreasoning based on lattice-valued logic.
the proceedings contain 44 papers. the special focus in this conference is on Principles and Practice of Knowledge Discovery in Databases. the topics include: Sailing as a machine learning challenge;two-eyed algorithm...
ISBN:
(纸本)3540200851
the proceedings contain 44 papers. the special focus in this conference is on Principles and Practice of Knowledge Discovery in Databases. the topics include: Sailing as a machine learning challenge;two-eyed algorithms and problems;power laws and self-similarity for graphs, streams and traditional data;propensity score methodology applied to estimate the effects of marketing interventions;efficient statistical pruning of association rules;majority classification by means of association rules;adaptive constraint pushing in frequent pattern mining;anticipated data reduction in constrained pattern mining;minimal k-free representations of frequent sets;discovering unbounded episodes in sequential data;a multi-relational naïve bayes classifier;improving prediction of the minority class in boosting;using belief networks and fisher kernels;a skeleton-based approach to learning bayesian networks from data;on decision boundaries of naïve bayes in continuous domains;application of inductive logicprogramming to structure-based drug design;visualizing class probability estimators;automated detection of epidemics from the usage logs of a physicians’ reference database;an indiscernibility-based clustering method with iterative refinement of equivalence relations;a novel approach on mining user preferences for personalized applications;explaining text clustering results using semantic structures;analyzing attribute dependencies;ranking interesting subspaces for clustering high dimensional data;efficiently finding arbitrarily scaled patterns;using transduction and multi-view learning to answer emails;exploring fringe settings of SVMs for classification;rule discovery and probabilistic modeling for onomastic data;constraint-based mining of sequential patterns over datasets with consecutive repetitions.
Insulation analysis is a comprehensive issue that relates theory and knowledge in many fields, sometimes achieving an accurate conclusion is still a problem yet unsolved. In this paper, a comprehensive analysis scheme...
详细信息
Insulation analysis is a comprehensive issue that relates theory and knowledge in many fields, sometimes achieving an accurate conclusion is still a problem yet unsolved. In this paper, a comprehensive analysis scheme based on the fuzzy logic is presented to synthesize more information came from both off-line tests and on-line monitoring, at the same time data mining is also used to find latent knowledge out. To combine various methods in systematically way, the fuzzy reasoning is adopted in this framework to manage the inherent uncertainty in various methods and semantic experiences accumulated by experts. the case studies show that this scheme is efficient and flexible.
the proceedings contain 30 papers. the special focus in this conference is on logic for programming, Artificial Intelligence, and reasoning. the topics include: Improving on-demand strategy annotations;first-order log...
ISBN:
(纸本)3540000100
the proceedings contain 30 papers. the special focus in this conference is on logic for programming, Artificial Intelligence, and reasoning. the topics include: Improving on-demand strategy annotations;first-order logic as a constraint programming language;maintenance of formal software developments by stratified verification;a note on universal measures for weak implicit computational complexity;extending compositional message sequence graphs;searching for invariants using temporal resolution;proof planning for feature interactions;an extension of BDICTL with functional dependencies and components;directed automatedtheorem proving;a framework for splitting BDI agents;on the complexity of disjunction and explicit definability properties in some intermediate logics;using BDDs with combinations of theories;on expressive description logics with composition of roles in number restrictions;query optimization of disjunctive databases with constraints through binding propagation;a non-commutative extension of MELL;procedural semantics for fuzzy disjunctive programs;pushdown specifications;theorem proving with sequence variables and flexible arity symbols;parallelism and tree regular constraints;a semantics for proof plans with applications to interactive proof planning;an isomorphism between a fragment of sequent calculus and an extension of natural deduction;a local system for linear logic;investigating type-certifying compilation with isabelle;automating type soundness proofs via decision procedures and guided reductions and abox satisfiability reduced to terminological reasoning in expressive description logics.
In this paper, we show how the clausal temporal resolution technique developed for temporal logic provides an effective method for searching for invariants. and so is suitable for mechanising a wide class of temporal ...
详细信息
ISBN:
(数字)9783540360780
ISBN:
(纸本)3540000100
In this paper, we show how the clausal temporal resolution technique developed for temporal logic provides an effective method for searching for invariants. and so is suitable for mechanising a wide class of temporal problems. We demonstrate that this scheme of searching for invariants can be also applied to a class of multi-predicate induction problems represented by mutually recursive definitions. Completeness of the approach, examples of the application of the scheme, and overview of the implementation are described.
We present a logic and logicprogramming based approach for analysing event-based requirements specifications given in terms of, a system's reaction to events and safety properties. the approach uses a variant of ...
详细信息
ISBN:
(纸本)3540439307
We present a logic and logicprogramming based approach for analysing event-based requirements specifications given in terms of, a system's reaction to events and safety properties. the approach uses a variant of Kowalski and Sergot's Event Calculus to represent such specifications declaratively and an abductive reasoning mechanism for analysing safety properties. Given a system description and a safety property, the abductive mechanism is able to identify a complete set of counterexamples (if any exist) of the property in terms of symbolic ''current" states and associated event-based transitions. A case study of an automobile cruise control system specified in the SCR framework is used to illustrate our approach. the technique described is implemented. using existing tools for abductive logicprogramming.
the class of finitary normal logic programs-identified recently, [1]-makes it possible to reason effectively with function symbols, recursion, and infinite stable models. these features may lead to a full integration ...
详细信息
ISBN:
(纸本)3540439307
the class of finitary normal logic programs-identified recently, [1]-makes it possible to reason effectively with function symbols, recursion, and infinite stable models. these features may lead to a full integration of the standard logicprogramming paradigm withthe answer set programming paradigm. For all finitary programs, ground goals axe decidable, while nonground goals are semidecidable. Moreover, the existing engines (that currently accept only much more restricted programs [11,7]) can be extended to handle finitary, programs by replacing their front-ends and keeping their core inference mechanism unchanged. In this paper, the theory of finitary normal programs is extended to disjunctive programs. More precisely, we introduce a suitable generalization of the notion of finitary program and extend all the results of [1] to this class. For this purpose, a consistency result by Fages is extended from normal programs to disjunctive programs. We also correct an error occurring in [1].
the proceedings contain 30 papers. the special focus in this conference is on Artificial Intelligence, automatedreasoning, and Symbolic Computation. the topics include: Expressiveness and complexity of full first-ord...
ISBN:
(纸本)3540438653
the proceedings contain 30 papers. the special focus in this conference is on Artificial Intelligence, automatedreasoning, and Symbolic Computation. the topics include: Expressiveness and complexity of full first-order constraints in the algebra of trees;deduction versus computation;integration of quantifier elimination with constraint logicprogramming;towards a hybrid symbolic/numeric computational approach in controller design;inductive synthesis of functional programs;on a generalised logicality theorem;using symbolic computation in an automated sequent derivation system for multi-valued logic;multicontext logic for semigroups of contexts;indefinite integration as a testbed for developments in multi-agent systems;genetic symbolic classification integrated with non-linear coefficient optimisation;a novel face recognition method;non-commutative logic for hand-written character modeling;from numerical to symbolic data during the recognition of scenarii;on mathematical modeling of networks and implementation aspects;continuous first-order constraint satisfaction;reasoning and scheduling with interval constraints;a genetic-based approach for satisfiability problems;the meaning of infinity in calculus and computer algebra systems and making conjectures about maple functions.
Meta-programming languages provide infrastructure to generate and execute object programs at run-time. In a typed setting, they contain a modal type constructor which classifies object code. these code types generally...
详细信息
ISBN:
(纸本)9781581134872
Meta-programming languages provide infrastructure to generate and execute object programs at run-time. In a typed setting, they contain a modal type constructor which classifies object code. these code types generally come in two flavors: closed and open. Closed code expressions can be invoked at run-time, but the computations over them are more rigid, and typically produce less efficient residual object programs. Open code provides better inlining and partial evaluation of object programs, but once constructed, expressions of this type cannot in general be evaluated. Recent work in this area has focused on combining the two notions into a sound system. We present a novel way to achieve this. It is based on adding the notion of names from the work on Nominal logic and FreshML to the lambda(square)-calculus of proof terms for the necessity fragment of modal logic S4. the resulting language provides a more fine-grained control over free variables of object programs when compared to the existing languages for meta-programming. In addition, this approach lends itself well to addition of intensional code analysis, i.e. ability of meta programs to inspect and destruct object programs at run-time in a type-safe manner, which we also undertake.
We propose a new way of extending logicprogramming (LP) for reasoning with uncertainty. Probabilistic finite domains (Pfd) capitalise on ideas introduced by Constraint LP, on how to extend the reasoning capabilities ...
详细信息
ISBN:
(纸本)3540439307
We propose a new way of extending logicprogramming (LP) for reasoning with uncertainty. Probabilistic finite domains (Pfd) capitalise on ideas introduced by Constraint LP, on how to extend the reasoning capabilities of the LP engine. Unlike other approaches to the field, Pfd syntax can be intuitively related to the axioms defining Probability and to the underlying concepts of Probability theory, (PT) such as sample space, events, and probability function. Probabilistic variables are core computational units and have two parts. Firstly, a finite domain, which at each stage holds the collection of possible values that can be assigned to the variable, and secondly a probabilistic function that can be used to assign probabilities to the elements of the domain. the two constituents are kept in isolation from each other. there are two benefits in such an approach. Firstly, that propagation techniques from finite domains research are retained, since a domain̵7;s representation is not altered. thus, a probabilistic variable continues to behave as a finite domain variable. Secondly, that the probabilistic function captures the probabilistic behaviour of the variable in a manner which is, to a large extent, independent of the particular domain values. the notion of events as used in PT can be captured by LP predicates containing probabilistic variables and the derives operator (⊢) as defined in LP. Pfd stores hold conditional constraints which are a computationally useful restriction of conditional probability from PT. Conditional constraints are defined by D1: π1⊕...⊕Dn: πn | Q1743;...743; Qm where, Di and Qj are predicates and each πi is a probability measure (0 ≤ πi ≤ 1, 1 ≤ i ≤ n, 1 ≤ j ≤ m). the conjuction of Qj̵7;s qualifies probabilistic knowledge about Di<
暂无评论