共查询到20条相似文献,搜索用时 0 毫秒
1.
Se-Hak Chun 《Personal and Ubiquitous Computing》2013,17(5):965-969
Recently security vulnerabilities and fraudulent transactions have simultaneously increase with the rise in use of smart mobile handsets for electronic transactions. Also, the governing liability rule on disputes arising from security breaches is becoming a practical issue as users get accustomed to doing transactions using various smart and intelligent computing devices in ubiquitous computing environments. Although there have been debates in law and computer science literature, there has been little research on legal issues in comparison with the amount of research on technical issues for electronic transactions. This paper analyzes how a burden of proof can play a role in preventing fraudulent transactions and investigates how it is related to firms’ investments in security. 相似文献
2.
Carneades is an open source argument mapping application and a programming library for building argumentation support tools. In this paper, Carneades?? support for argument reconstruction, evaluation and visualization is illustrated by modeling most of the factual and legal arguments in Popov v Hayashi. 相似文献
3.
通过对Agent间存在的有关社会性的关键元素进行分析,建立了基于辩论的社会性Agent间的谈判模型,并建立了相关的决策函数;然后通过一个存在于多Agent社会中而具有社会性的Agent间的谈判实例,在假设了相关数据的基础上对模型和决策函数进行了举例计算,分析验证了其有效性,并在对相关的谈判原语作出定义的基础上对此谈判实例的辩论对话过程进行了模拟。 相似文献
4.
5.
An approach is presented for modeling networks of processes that communicate exclusively through message passing. A process (or a network) is defined by its set of possible behaviors, where each behavior is an abstraction of an infinite execution sequence of the process. The resulting model is simple and modular and facilitates information hiding. It can describe both synchronous and asynchronous networks. It supports recursively-defined networks and can characterize liveness properties such as progress of inputs and outputs, termination, and deadlock.A sound and complete temporal proof system based on the model is presented. It is compositional — a specification of a network is formed naturally from specifications of its components.Van Nguyen received a B.S. degree from Monash University in 1982, an M.S. degree from Cornell University in 1983 and a Ph.D. degree from Cornell University in 1985. He has accepted a research position at the IBM Thomas J. Watson Research Center. His research interests include logics and semantics of programs, programming languages, program synthesis and distributed computing.David Gries received a Ph.D. (actually, a Dr. rer. nat.) from the Munich Institute of Technology (Germany) in 1966. He was an assistant professor at Stanford from 1966 to 1969 and has been on the faculty of Computer Science at Cornell since 1969, where he is presently chairman of the department. He is known for his research in compilers (he is a co-author of the Alcor-Illinois 7090 Algol compiler, finished in 1964), for his research in programming methodology, and for his texts Compiler Construction for Digital Computers (1971) and Science of Programming (1981). He was a Guggenheim Fellow in 1984–85.Susan Owicki received the B.S. degree in mathematics from Michigan State University in 1968. She then attended Cornell University as an NSF Fellow, receiving the M.S. and Ph.D. degrees in computer science in 1970 and 1975, respectively. From 1975 to 1976 she was an Assistant Professor in the Department of Computer Science at Cornell University. Since then she has been a member of the Department of Electrical Engineering at Stanford University, where she is currently an Associate Professor.Dr. Owicki's research in the area of concurrent programming has included work in program verification, programming languages and methodology, and design of algorithms for concurrent systems. She has been particularly interested in problems in computer networks and distributed systems.This work was supported by the NSF under grants MCS-81-03605, DCR-83-202-74, and DCR-83-123-19; by NASA under contract NAGW419; and by the third author's Guggenheim FellowshipThis paper is based on part of the first author's Ph.D. thesis 相似文献
6.
Kevin D. Ashley 《Artificial Intelligence and Law》2002,10(1-3):163-218
This article describes recent jurisprudential accountsof analogical legal reasoning andcompares them in detail to the computational modelof case-based legal argument inCATO. The jurisprudential models provide a theoryof relevance based on low-levellegal principles generated in a process ofcase-comparing reflective adjustment. Thejurisprudential critique focuses on the problemsof assigning weights to competingprinciples and dealing with erroneously decidedprecedents. CATO, a computerizedinstructional environment, employs ArtificialIntelligence techniques to teach lawstudents how to make basic legal argumentswith cases. The computational modelhelps students test legal hypotheses againsta database of legal cases, draws analogiesto problem scenarios from the database, andcomposes arguments by analogy with a setof argument moves. The CATO model accountsfor a number of the important featuresof the jurisprudential accounts, includingimplementing a kind of reflective adjustment.It also avoids some of the problems identifiedin the critique; for instance, it deals withweights in a non-numeric, context-sensitivemanner. The article concludes by describingthe contributions AI research can make tojurisprudential investigations of complexcognitive phenomena of legal reasoning. Forinstance, unlike the jurisprudential models,CATO provides a detailed account of how togenerate multiple interpretations of a citedcase, downplaying or emphasizing the legalsignificance of distinctions in terms of thepurposes of the law as the argument contextdemands. 相似文献
7.
Larry Wos 《Journal of Automated Reasoning》1992,9(3):407-408
This article is the twenty-fourth of a series of articles discussing various open research problems in automated reasoning. The problem proposed for research asks one to find an appropriate theory for modulating across argument and across literal boundaries. Because demodulation has proved so useful—is most cases, even crucial—to automated reasoning, extending this concept to permit canonicalization to be applied at the predicate and at the clause and subclause levels merits exploration. For evaluating a proposed solution to this research problem, we suggest problems from mathematics, logic, program verification, database inquiry, and the world of puzzles.This work was supported by the Applied Mathematical Sciences subprogram of the Office of Energy Research, U.S. Department of Energy, under Contract W-31-109-Eng-38. 相似文献
8.
9.
10.
Rationales and argument moves 总被引:2,自引:1,他引:1
We discuss five kinds of representations of rationales and provide a formal account of how they can alter disputation. The formal model of disputation is derived from recent work in argument. The five kinds of rationales are compilation rationales, which can be represented without assuming domain-knowledge (such as utilities) beyond that normally required for argument. The principal thesis is that such rationales can be analyzed in a framework of argument not too different from what AI already has. The result is a formal understanding of rationales, a partial taxonomy, and a foundation for computer programs that represent and reason with rationales.The five kinds of rationales are as follows: (c)ompression and (s)pecialization, which yield rules, and (d)isputation, which yields a decision. These are modeled as potentially changing the focus of the dispute. Then there are (f)it, a rationale for rules, and (r)esolution, a rationale for decisions. These cannot be modeled as simply; they force disputation to a meta-level, at least temporarily.The paper first discusses each kind of rationale in the abstract. Then it produces a model of dispute in which the simpler rationales can be analyzed. Formal examples are given. The model is augmented to allow analysis of the more difficult rationales. Examples are again given. The discussion is not intended to be strictly mathematical; rather, it aims to use formal methods to illuminate and provide framework for future interpretation and implementation. 相似文献
11.
On a new formal proof model for RFID location privacy 总被引:2,自引:0,他引:2
We discuss a recently proposed formal proof model for RFID location privacy. We show that protocols which intuitively and in several other models are considered not to be location private, are provably location private in this model. Conversely, we also show that protocols which obviously are location private, are not considered location private in this model.Specifically, we prove a protocol in which every tag transmits the same constant message to not be location private in the proposed model. Then we prove a protocol in which a tag's identity is transmitted in clear text to be weakly location private in the model. 相似文献
12.
Chersoni Emmanuele Santus Enrico Lenci Alessandro Blache Philippe Huang Chu-Ren 《Language Resources and Evaluation》2021,55(4):873-900
Language Resources and Evaluation - This work addresses some questions about language processing: what does it mean that natural language sentences are semantically complex? What semantic features... 相似文献
13.
Under mild conditions, the likelihood function associated with an ARMA model asymptotically has a unique stationary point which is a global maximum corresponding to the true parameter values. This note gives a new proof of this fact. The proof is considerably simpler than that previously published. 相似文献
14.
The notion of proof in hardware verification 总被引:2,自引:0,他引:2
Avra Cohn 《Journal of Automated Reasoning》1989,5(2):127-139
Recent advances in the field of hardware verification have raised some fresh (and some familiar) issues concerning the scope and limitations of formal proof. In this article, we discuss in detail some of these issues. We focus particularly on which aspects of hardware and software one can verify, in contrast to the claims that are sometimes made in that regard. Since we consider verification to be one of the more important and promising applications of automated theorem proving — our research has been concerned with this application for a number of years — a precise understanding of verification must be addressed. Although the context for our discussion is the Viper verification project, our remarks apply generally. Viper is a microprocessor designed by W. J. Cullyer, C. Pygott, and J. Kershaw of the Royal Signals and Radar Establishment of the U.K. Ministry of Defence, for use in safety-critical applications. Much to their credit, the designers intended from the start that Viper be formally verified; they presented Viper's more abstract specifications in a language suitable for formal reasoning, and they placed the design in the public domain. Since Viper microprocessors are currently being marketed as verified chips, the need exists to identify precisely to what extent verification is possible. The formal proof aspects of the verification work have been carried out at the Computer Laboratory of the University of Cambridge. To date, some important properties of a register-transfer level model of Viper, relative to a more abstract functional specification, have been proved (by the author) using the HOL proof generating system. Verified systems such as Viper seem likely to become commonplace in the near future. While proofs about the abstract models of such systems are obviously a vital contribution to our trust in them, it is also important (not least in safety-critical applications) that the limitations of the approach be understood. 相似文献
15.
This paper describes how the communication protocol of Mondex electronic purses can be specified and verified against desired
security properties. The specification is developed by stepwise refinement using the RAISE formal specification language,
RSL, and the proofs are made by translation to PVS and SAL. The work is part of a year-long project contributing to the international
grand challenge in verified software engineering.
J. C. P. Woodcock 相似文献
16.
《IEEE transactions on pattern analysis and machine intelligence》2000,26(10):1022-1023
The limits to the reliability that can be claimed for a design-diverse fault-tolerant system are mainly determined by the dependence that must be expected in the failure behaviours of the different versions: claims for independence between version failure processes are not believable. We examine a different approach, in which a simple secondary system is used as a back-up to a more complex primary. The secondary system is sufficiently simple that claims for its perfection (with respect to design faults) are possible, but there is not complete certainty about such perfection. It is shown that assessment of the reliability of the overall fault-tolerant system in this case may take advantage of claims for independence that are more plausible than those involved in design diversity 相似文献
17.
18.
19.
Robert I. Damper 《Minds and Machines》2006,16(2):163-183
John Searle’s Chinese room argument (CRA) is a celebrated thought experiment designed to refute the hypothesis, popular among artificial intelligence (AI) scientists and philosophers of mind, that “the appropriately programmed computer really is a mind”. Since its publication in 1980, the CRA has evoked an enormous amount of debate about its implications for machine intelligence, the functionalist philosophy of mind, theories of consciousness, etc. Although the general consensus among commentators is that the CRA is flawed, and not withstanding the popularity of the systems reply in some quarters, there is remarkably little agreement on exactly how and why it is flawed. A newcomer to the controversy could be forgiven for thinking that the bewildering collection of diverse replies to Searle betrays a tendency to unprincipled, ad hoc argumentation and, thereby, a weakness in the opposition’s case. In this paper, treating the CRA as a prototypical example of a ‘destructive’ thought experiment, I attempt to set it in a logical framework (due to Sorensen), which allows us to systematise and classify the various objections. Since thought experiments are always posed in narrative form, formal logic by itself cannot fully capture the controversy. On the contrary, much also hinges on how one translates between the informal everyday language in which the CRA was initially framed and formal logic and, in particular, on the specific conception(s) of possibility that one reads into the logical formalism.Based on a paper presented at International Congress on Thought Experiments Rethought, Centre for Logic and Philosophy of Science, Ghent University, Belgium, 24–25 September 2004. 相似文献
20.
This article reviews the history of the use of computers to automate mathematical proofs. It identifies three broad strands of work: automatic theorem proving where the aim is to simulate human processes of deduction; automatic theorem proving where any resemblance to how humans deduce is considered to be irrelevant; and interactive theorem proving, where the proof is directly guided by a human being. The first strand has been underpinned by commitment to the goal of artificial intelligence; practitioners of the second strand have been drawn mainly from mathematical logic; and the third strand has been rooted primarily in the verification of computer programs and hardware designs 相似文献