In this paper we continue to develop the approach to automated search for theorem proofe started in Kyiv in 1960-1970s. this approatch presupposes the development of deductive techniques used for the processing of mat...
详细信息
ISBN:
(纸本)3540664920
In this paper we continue to develop the approach to automated search for theorem proofe started in Kyiv in 1960-1970s. this approatch presupposes the development of deductive techniques used for the processing of mathematical texts, written in a formal first-order language, close to the natural language used in mathematical papers. We construct two logical caJculi, gS tnd mS, satisfying the following requirements: the syntacticetl form of the initial problem should be preserved;the proof search should be goal-oriented;preliminary skolemization is not obligatory;equality handling should be sepeurated from the deduction process. the calculus gS is a machine-oriented sequent-type csilculus with "large-block" inference rules for first-order classical logic. the calculus mS is a further development of the calculus gS, enriched with formal analogs of the natursil proof sesurch techniques such as definition handling and application of auxiliary propositions. the results on soundness and completeness of gS and mS aie given.
there has been increasing interest in recent times for using fuzzy logic techniques to represent software metric models, especially those predicting the software development effort. the use of fuzzy logic for this app...
详细信息
there has been increasing interest in recent times for using fuzzy logic techniques to represent software metric models, especially those predicting the software development effort. the use of fuzzy logic for this application area offers several advantages when compared to other commonly-used techniques. these include the use of a single model with different levels of precision for the inputs and outputs used throughout the development life-cycle, the possibility of model development with little or no data, and its effectiveness when used as a communication tool. the use of fuzzy logic in any applied field, however, requires that suitable tools are available for both practitioners and researchers-satisfying both interface- and functionality-related requirements. After outlining some of the specific needs of the software metrics community, including results from a survey of software developers on this topic, this paper describes the use of a set of tools called FULSOME (FUzzy logic for SOftware MEtrics). the development of a simple fuzzy logic system by a software metrician and its subsequent tuning are then discussed using a real-world set of software metric data. the automatically generated fuzzy model performs acceptably when compared to regression-based models.
Modern embedded Systems-on-Chips (SOCs) will allow the system designer to customize Intellectual Property (IP) cores (fixed and programmable), together with custom logic and large amounts of embedded memory. As the so...
详细信息
Modern embedded Systems-on-Chips (SOCs) will allow the system designer to customize Intellectual Property (IP) cores (fixed and programmable), together with custom logic and large amounts of embedded memory. As the software content in these emerging embedded SOCs begins to dominate the SOC design process, there is a critical need for support of an integrated software development environment (including compilers, simulators and debuggers). Furthermore, since many characteristics of these processor core IPs (e.g., instruction-sets, memory configurations) are increasingly customizable, the entire software toolkit chain needs to be customized and generated to support both early design space exploration (for performance, power and cost constraints), as well as high-qualify software generation. this paper first surveys recent efforts in Architecture Description Languages (ADLs) used to perform early validation and exploration of SOC architectures. the second part of the paper focuses on approaches to software toolkit generation that automatically produce the software infrastructure (e.g., compilers, simulators, debuggers) which will enable true hardware/software codesign of these emerging embedded SOCs.
Empirical models for the management of software development projects have until recently been based, with only limited exceptions, on linear least-squares regression. the continued failure of the resulting empirical m...
详细信息
Empirical models for the management of software development projects have until recently been based, with only limited exceptions, on linear least-squares regression. the continued failure of the resulting empirical models to provide adequate assistance to managers has led to the examination (and even some adoption) of more sophisticated modeling techniques. these techniques have included robust statistical procedures, various forms of neural network models, fuzzy logic, case-based reasoning, and regression trees. this paper describes a simulation-based study on the performance of some of these empirical modeling techniques using a size and effort software metric data set. the models are assessed using a variety of "goodness of fit" measures-assessing the predictive performance on hold-out samples across 50 simulations using both sampling with replacement and without replacement. the relative performances of each technique can be used to select that which is "best" given the desired predictive accuracy criterion. Overall the best performing technique appears to be M-estimation. this suggests that robustness to outliers, in this case at least, may be more important than modeling non-linearities or interactions.
TraditioneJly, biochemical systems are modelled using kinetics íind differential equations in a quantitative simulator. However, for msiny biological processes detailed quantitative information is not available, ...
详细信息
We introduce a semantics of logicprogramming based on an classical Game theory, which is proven to be sound and complete w.r.t. the traditional operational semantics and Negation as Failure. this game semantics is ba...
详细信息
In logicprogramming, almost no work has been done so far on proving that certain queries cannot succeed. Work in this direction could be useful for queries which seem to be non-terminating. Such queries are not excep...
详细信息
this paper deals withthe incremental detection of implicit equalities using the revised simplex method. this algorithm is more efficient and more suitable to practical problems than the tableau method usually applied...
详细信息
the proceedings contain 31 papers. the special focus in this conference is on Static Analysis and Software Methodologies. the topics include: logicprogramming and model checking;the copying approach to tabling;a mult...
ISBN:
(纸本)3540650121
the proceedings contain 31 papers. the special focus in this conference is on Static Analysis and Software Methodologies. the topics include: logicprogramming and model checking;the copying approach to tabling;a multithreaded execution environment for sicstus prolog;a framework for bottom up specialisation of logic programs;termination of logic programs with block declarations running in several modes;the boolean logic of set sharing analysis;derivation of proof methods by abstract interpretation;detecting unsolvable queries for definite logic programs;staging static analyses using abstraction-based program specialization;type domains and type representations for logic programs;a methodology for language development;explicit substitutions for objects and functions;the complexity of late-binding in dynamic object-oriented languages;a compiler for rewrite programs in associative-commutative theories;solution to the problem of zantema on a persistent property of term rewriting systems;a general framework for r-unification problems;operational versus denotational methods in the semantics of higher order languages;functional implementations of continuous modeled animation;compiling erlang to scheme;compiling lazy functional programs for the java virtual machine;a game semantics foundation for logicprogramming;controlling search in declarative programs;encapsulating data in logicprogramming via categorical constraints;constructive negation using typed existence properties;optimal reduction of functional expressions;embedding multiset constraints into a lazy functional logic language;a hidden herbrand theorem and integrating constraint propagation in complete solving of linear diophantine systems.
When combining languages for symbolic constraints, one is typically faced withthe problem of how to treat "mixed" constraints. the two main problems are (1) how to define a combined solution structure over ...
详细信息
When combining languages for symbolic constraints, one is typically faced withthe problem of how to treat "mixed" constraints. the two main problems are (1) how to define a combined solution structure over which these constraints are to be solved, and (2) how to combine the constraint solving methods for pure constraints into one for mixed constraints. the paper introduces the notion of a "free amalgamated product" as a possible solution to the first problem. We define so-called quasi-free structures (called "strong simply-combinable structures" in a previous publication) as a generalization of free structures. For quasi-free structures over disjoint signatures, we describe a canonical amalgamation construction that yields the free amalgamated product. the combination techniques known from unification theory can be used to combine constraint solvers for quasi-flee structures over disjoint signatures into a solver for their free amalgamated product. In addition to term algebras module equational theories (i.e., free algebras), the class of quasi-free structures contains many solution structures that are of interest in constraint logicprogramming, such as the algebra of rational trees, feature structures, and domains consisting of hereditarily finite (well-founded or non-well-founded) nested sets and lists.
暂无评论