the proceedings contains 177 papers form the National conference on Artificial Intelligence. the topics discussed include: the yard allocation problem;graph coloring with quantum heuristics;on computing all abductive ...
详细信息
the proceedings contains 177 papers form the National conference on Artificial Intelligence. the topics discussed include: the yard allocation problem;graph coloring with quantum heuristics;on computing all abductive explanation;logicprogramming with ordered disjunction;progressive rademacher sampling;bootstrap learning for place recognition;extended isomap for pattern classification;and planning with a language for extended goals.
Systems biology is a new area in biology that aims at achieving a systems-level understanding of biological systems. While current genome projects provide a huge amount of data on genes or proteins, lots of research i...
详细信息
ISBN:
(纸本)3540439307
Systems biology is a new area in biology that aims at achieving a systems-level understanding of biological systems. While current genome projects provide a huge amount of data on genes or proteins, lots of research is still necessary to understand how the different parts of a biological system interact in order to perform complex biological functions. Computational models that help to analyze, explain or predict the behavior of biological systems play a crucial role in systems biology. the goal of this paper is to show that-hybrid concurrent constraint programming [11] may be a promising alternative to existing modeling approaches in systems biology. Hybrid cc is, a declarative compositional programming language with a well-defined semantics. It allows one to model and simulate the dynamics of hybrid systems, which exhibit both discrete and continuous change. We show. that Hybrid cc can be used naturally to model a variety of biological phenomena, such as reaching thresholds, kinetics, gene interaction or biological pathways.
Prolog has been used as an inference engine of many systems, and it is natural to use Prolog as an inference engine of intelligent agent systems. However, Prolog assumes that a program does not change. this poses a pr...
详细信息
ISBN:
(纸本)3540439307
Prolog has been used as an inference engine of many systems, and it is natural to use Prolog as an inference engine of intelligent agent systems. However, Prolog assumes that a program does not change. this poses a problem because the agent might work in a dynamic environment where unexpected things can happen. In order to use a Prolog-like procedure as an inference engine of an agent, the procedure should be able to modify the computation, if necessary, after updating the program or executing an action. We introduce a new Prolog-like procedure which integrates planning, action execution, program updates, and plan modifications. Our new procedure computes plans by abduction. During or after a computation, it can update a program by adding a rule to the program or deleting a rule from the program. After updating the program, it modifies the computation, cuts invalid plans, and adds new valid plans. We use the technique of Dynamic SLDNF (DSLDNF) [1] [2] to modify computation after updating a program. It is also possible to execute an action during or after planning. We can use three types of actions: an action without a side effect; an action with a side effect which can be undone; an action with a side effect which cannot be undone. Following the result of action execution, the procedure modifies the computation: invalid plans are erased; some actions are undone; some redundant actions are erased. Even if a plan becomes invalid, it is possible to switch to another plan without loss of correctness. Based on the technique described above, we implemented an intelligent mobile network agent system, pi-coPlangent.
the proceedings contain 18 papers. the special focus in this conference is on Constraints, Program Transformation and Analysis. the topics include: the essence of XML;to the gates of HAL;functional logic design patter...
ISBN:
(纸本)3540442332
the proceedings contain 18 papers. the special focus in this conference is on Constraints, Program Transformation and Analysis. the topics include: the essence of XML;to the gates of HAL;functional logic design patterns;on consistency and width notions for constraint programs with algebraic constraints;solving mixed quantified constraints over a domain based on real numbers and herbrand terms;on the correctness of the factoring transformation;lambda-lifting in quadratic time;the well-founded semantics in normal logic programs with uncertainty;monadic and CPS transformations into the linear lambda calculus;coinductive interpreters for process calculi;descendants and head normalization of higher-order rewrite systems;narrowing failure in functional logicprogramming;system description and performance evaluation;dynamic-cut with definitional trees;the head condition and polymorphic recursion;structural abstraction and application in logicprogramming and a functional calculus for scientific discovery.
Classes are the basic modules in object-oriented (00) software, which consist of attributes and methods. thus, in 00 environment, the cohesion is mainly about how tightly the attributes and methods of classes. this pa...
详细信息
ISBN:
(纸本)0769518192
Classes are the basic modules in object-oriented (00) software, which consist of attributes and methods. thus, in 00 environment, the cohesion is mainly about how tightly the attributes and methods of classes. this paper discusses the relationships between attributes and attributes, attributes and methods, methods and methods of a class based on dependence analysis. then we discuss the properties of these relationships. According to these properties, this paper proposes a novel approach to measuring the class cohesion. Our approach overcomes the limitations of previous class cohesion measures, which consider only one or two of the three relationships in a class. We also prove that this measure satisfies the properties that a good measurement should have.
the proceedings contain 40 papers. the special focus in this conference is on Description logics, Semantic Web, Proof-Carrying Code, Compiler Verification, Non-classical logics and System Descriptions. the topics incl...
ISBN:
(纸本)3540439315
the proceedings contain 40 papers. the special focus in this conference is on Description logics, Semantic Web, Proof-Carrying Code, Compiler Verification, Non-classical logics and System Descriptions. the topics include: Reasoning with expressive description logics;temporal logic for proof-carrying code;formal verification of a java compiler in Isabelle;embedding lax logic into intuitionistic logic;combining proof-search and counter-model construction for deciding godel-dummett logic;connection-based proof search in propositional bi logic;a library for solving quantified difference inequalities;an lcf-style interface between HOL and first-order logic;the math web software bus for distributed mathematical reasoning;testing satisfiability of CNF formulas by computing a stable set of points;a sat based approach for solving formulas over Boolean and linear mathematical propositions;deductive search for errors in free data type specifications using model generation;reasoning by symmetry and function ordering in finite model generation;algorithmic aspects of herbrand models represented by ground atoms with ground equations;a new clausal class decidable by hyperresolution;the hr program for theorem generation;the quest for efficient Boolean satisfiability solvers;recursive path orderings can be context-sensitive;formal verification of a combination decision procedure;a study in meta-theoretic reasoning;faster proof checking in the Edinburgh logical framework;solving for set variables in higher-order theorem proving;lazy theorem proving for bounded model checking over infinite domains and focussing proof-net construction as a middleware paradigm.
the Object Relation Diagram (ORD) of a program is a class interdependence diagram which has applications in a wide variety of software engineering problems (e.g., integration testing, integration coverage analysis, re...
详细信息
ISBN:
(纸本)0769518192
the Object Relation Diagram (ORD) of a program is a class interdependence diagram which has applications in a wide variety of software engineering problems (e.g., integration testing, integration coverage analysis, regression testing, impact analysis, program understanding, and reverse engineering). Because the imprecision of the ORD directly affects the practicality of its usage, it is important to investigate techniques for constructing precise ORDs. this paper makes three contributions. First, we develop the Extended Object Relation Diagram (ExtORD), a version of the ORD designed for use in integration coverage analysis. the ExtORD shows the specific statement that creates an interclass dependence, and can be easily constructed by extending techniques for ORD construction. Second, we develop a general algorithm for ORD construction, parameterized by class analysis. third, we demonstrate empirically that relatively precise class analyses can significantly improve diagram precision compared to earlier work, resulting in average size reduction of 55% for the ORD and 39% for the ExtORD.
Lax logic is obtained from intuitionistic logic by adding a single modality ◦ which captures properties of necessity and possibility. this modality was considered by Curry in two papers from 1952 and 1957 and rediscov...
详细信息
For many years all known completeness results for Knuth- Bendix completion and ordered paramodulation required the term ordering γ to be well-founded, monotonic and total(izable) on ground terms. then, it was shown t...
详细信息
In this paper we define a new clausal class, called BU, which can be decided by hyperresolution with splitting. We also consider the model generation problem for BU and show that hyperresolution plus splitting can als...
详细信息
暂无评论