Filters








103,474 Hits in 11.6 sec

A Case-Based Approach to Tailoring Software Processes [chapter]

Scott Henninger, Kurt Baumgarten
2001 Lecture Notes in Computer Science  
A rule-based system is used to tailor the SDM to meet the characteristics of individual projects and provide relevant development knowledge throughout the development lifecycle.  ...  The volatility of knowledge in software development demands approaches that retrieve episodic knowledge and support the continuous knowledge acquisition process.  ...  The Rule-Based System In BORE, the process of tailoring the SDM schema to the specific characteristics of a project involves answering questions from a rule-based system.  ... 
doi:10.1007/3-540-44593-5_18 fatcat:qvkqwj47vfh6lnh77gcsvxjvuq

A computational approach to socially distributed cognition

Pierre Dillenbourg, John A. Self
1992 European Journal of Psychology of Education  
The learning outcome is a structuration of knowledge (rules) into situation-specific models, used to guide reasoning.  ...  This argumentation involves a sequence of arguments and their refutations.  ...  Acknowledgments Thanks to Michael Baker, William Clancey and the editors for their valuable comments on previous drafts of this paper.  ... 
doi:10.1007/bf03172899 fatcat:5mziyrf4ozgazfque7256sxieq

Possible Models Computation and Revision – A Practical Approach [chapter]

Peter Baumgartner
2020 Lecture Notes in Computer Science  
This paper describes a method of computing plausible states of a system as a logical model.  ...  The problem of analyzing state-based systems as they evolve over time has been studied widely in the automated reasoning community (and others).  ...  I thank the reviewers for their constructive comments. Yuzhou Chen discovered an error in an earlier version of the paper.  ... 
doi:10.1007/978-3-030-51074-9_19 fatcat:hzhbrdoyzncsto5l74zappkcvi

Computing Preferred Extensions in Abstract Argumentation: A SAT-Based Approach [chapter]

Federico Cerutti, Paul E. Dunne, Massimiliano Giacomin, Mauro Vallati
2014 Lecture Notes in Computer Science  
This paper presents a novel SAT-based approach for the computation of extensions in abstract argumentation, with focus on preferred semantics, and an empirical evaluation of its performances.  ...  The approach is based on the idea of reducing the problem of computing complete extensions to a SAT problem and then using a depth-first search method to derive preferred extensions.  ...  -For each valid case, each system gets a score of 1/(1 + log 10 (T /T * )), where T is its execution time, or a score of 0 if it fails in that case.  ... 
doi:10.1007/978-3-642-54373-9_12 fatcat:cxuvl53li5aflafazfhkj3pboa

A Soft Computing Approach to Kidney Diseases Evaluation

José Neves, M. Rosário Martins, João Vilhena, João Neves, Sabino Gomes, António Abelha, José Machado, Henrique Vicente
2015 Journal of medical systems  
Acute kidney injury appears abruptly, with a rapid deterioration of the renal function, but is often reversible if it is recognized early and treated promptly.  ...  In both situations, i.e., acute kidney injury and chronic kidney disease, an early intervention can significantly improve the prognosis.  ...  In this section, it is set a soft computing approach to model the universe of discourse of any patient suffering from chronic kidney disease, based on ANNs, which are used to structure data and capture  ... 
doi:10.1007/s10916-015-0313-4 pmid:26310948 fatcat:6hlaoyn6knacfmkixnqv6ljsfu

A syntactic approach to fixed point computation on finite domains

Tyng-Ruey Chuang, Benjamin Goldberg
1992 ACM SIGPLAN Lisp Pointers  
We outline the development of a syntactic approach, and show that the syntactic approach is sound and complete with respect to semantics.  ...  We propose a syntactic approach to performing fixed point computation on finite domains.  ...  , alge- applied to their arguments. braic reduction rules for those finite domains are allowed Secondly, Type .2 is the ground type of language A.  ... 
doi:10.1145/141478.141517 fatcat:xdspf75vgffxfb5ajbkxshjci4

A practical approach to hypothetical database queries [chapter]

Henning Christiansen, Troels Andreasen
1998 Lecture Notes in Computer Science  
In case h is inconsistent with the database, query evaluation becomes a special case of counterfactual reasoning.  ...  The embedded hypothesis in a hypothetical query indicates, so to say, a state of the database intended for the rest of the query.  ...  to be able to check the validity of counterfactual arguments.  ... 
doi:10.1007/bfb0055505 fatcat:y775cbw55vfa5mz3lyvncdpcwa

A syntactic approach to fixed point computation on finite domains

Tyng-Ruey Chuang, Benjamin Goldberg
1992 Proceedings of the 1992 ACM conference on LISP and functional programming - LFP '92  
We outline the development of a syntactic approach, and show that the syntactic approach is sound and complete with respect to semantics.  ...  We propose a syntactic approach to performing fixed point computation on finite domains.  ...  , alge- applied to their arguments. braic reduction rules for those finite domains are allowed Secondly, Type .2 is the ground type of language A.  ... 
doi:10.1145/141471.141517 dblp:conf/lfp/ChuangG92 fatcat:gipqy6kfqvbq5agqliwqtz73o4

Model theory of deduction: a unified computational approach

B Bara
2001 Cognitive Science  
We validate the theory through a computational model (UNICORE) which allows fine-grained predictions of subjects' performance in different reasoning domains.  ...  Our conclusion is that the validity of the mental model approach is confirmed for the deductive reasoning domain, and that it is possible to devise a unique mechanism able to deal with the specific subareas  ...  Acknowledgments The authors were supported in this research by M.U.R.S.T. of Italy (cofinanced project 2001, Deduction and induction).  ... 
doi:10.1016/s0364-0213(01)00056-8 fatcat:gpiup2xjujgonk4pyuegdcdesu

Model theory of deduction: a unified computational approach

Bruno G. Bara, Monica Bucciarelli, Vincenzo Lombardo
2001 Cognitive Science  
We validate the theory through a computational model (UNICORE) which allows fine-grained predictions of subjects' performance in different reasoning domains.  ...  Our conclusion is that the validity of the mental model approach is confirmed for the deductive reasoning domain, and that it is possible to devise a unique mechanism able to deal with the specific subareas  ...  Acknowledgments The authors were supported in this research by M.U.R.S.T. of Italy (cofinanced project 2001, Deduction and induction).  ... 
doi:10.1207/s15516709cog2506_1 fatcat:2bawnok43rakhe5usp7hwmkxmy

A Two-Level Logic Approach to Reasoning About Computations

Andrew Gacek, Dale Miller, Gopalan Nadathur
2011 Journal of automated reasoning  
We also describe an interactive theorem prover called Abella that implements G and this two-level logic approach and we present several examples that demonstrate the efficacy of Abella in reasoning about  ...  We show how provability in the specification logic can be transparently encoded in G.  ...  Moreover, the reading of the complete set of clauses for a given predicate, such as member, is that the predicate holds for some arguments just in the case that the predicate with these arguments matches  ... 
doi:10.1007/s10817-011-9218-1 fatcat:jtt7qft2jja25hpkr6ik4qemly

A two-level logic approach to reasoning about computations [article]

Andrew Gacek, Dale Miller, Gopalan Nadathur
2010 arXiv   pre-print
We also describe an interactive theorem prover called Abella that implements G and this two-level logic approach and we present several examples that demonstrate the efficacy of Abella in reasoning about  ...  We provide these capabilities here by using a logic called G which represents relations over lambda-terms via definitions of atomic judgments, contains inference rules for induction and co-induction, and  ...  Moreover, the reading of the complete set of clauses for a given predicate, such as member, is that the predicate holds for some arguments just in the case that the predicate with these arguments matches  ... 
arXiv:0911.2993v2 fatcat:k662fjb7jzdadaixy62l7jd7b4

A general approach to bottom-up computation of disjunctive semantics [chapter]

Stefan Brass, Jürgen Dix
1995 Lecture Notes in Computer Science  
The computation of the residual program is also valid under many other semantics, e.g. the static Prz95] and stationary Prz91b] semantics.  ...  In our case, we utilize (a disjunctive extension of) Clark's completion Cla78], which is equivalent to the stable model semantics for residual programs.  ...  Acknowledgement The comments of Hendrik Decker, Udo Lipeck, and Teodor Przymusinski have been very helpful.  ... 
doi:10.1007/bfb0030663 fatcat:t6fijozzczbdrlkrrdaveh26se

Defining volunteer computing: a formal approach
Определение добровольных вычислений: формальный подход

Attila Csaba Marosi, Robert Lovas
2015 Компьютерные исследования и моделирование  
However, most formal approaches model a particular middleware and do not focus on the general notion of volunteer or desktop grid computing.  ...  To this end formal modeling is applied that tries to grasp the semantic of their functionalitiesas opposed to comparisons based on properties, features, etc.  ...  The firs model in the series (M GROUND-DG ) is based on the model presented in [Németh Z., & Sunderam V., 2003; Kertész A., & Németh Z., 2009] .  ... 
doi:10.20537/2076-7633-2015-7-3-565-571 fatcat:nx3euvrgpbgd7di4wdyl25osqq

A Computational Logic Approach to Human Spatial Reasoning

Emmanuelle-Anna Dietz, Steffen Holldobler, Raphael Hops
2015 2015 IEEE Symposium Series on Computational Intelligence  
In particular, we develop a computational logic approach to spatial reasoning and show that the weak completion semantics computes preferred mental models.  ...  In this paper we present a new approach with respect to spatial reasoning problems by using logic programs.  ...  Thereafter, we introduce the computational logic approach based on the weak completion semantics in Section 3.  ... 
doi:10.1109/ssci.2015.229 dblp:conf/ssci/DietzHH15 fatcat:m2x6p3iqwzgyjozjdmezh4g46q
« Previous Showing results 1 — 15 out of 103,474 results