Results 231 to 240 of about 10,419 (259)

A decision procedure for a temporal belief logic

2005
This paper presents a temporal belief logic called LTB. In addition to the usual connectives of linear discrete temporal logic, LTB contains an indexed set of modal belief connectives, via which it is possible to represent the belief systems of resource-bounded reasoning agents.
Michael J. Wooldridge, Michael Fisher 0001   +1 more
openaire   +2 more sources

A resolution procedure based on a fuzzy logic

Ninth IEEE International Conference on Fuzzy Systems. FUZZ- IEEE 2000 (Cat. No.00CH37063), 2002
As the use of non-classical logics become increasingly important in computer science, artificial intelligence and logic programming, the development of efficient automated theorem proving based on non-classical logic is currently an active area of research. The paper aims at the resolution principle for the Pavelka type fuzzy logic.
Jun Liu 0001, Zhenming Song, Keyun Qin
openaire   +1 more source

Enhancing Strategy Logic with Procedural Rationality

Proceedings of the AAAI Conference on Artificial Intelligence
ATL and Strategy Logic (SL) are important languages for representation and reasoning about strategic abilities of coalitions in multi-agent systems. In analyzing strategies of agents in multi-agent systems, an important concept to consider is rationality. Strategy Logic can express rationality concepts such as Nash Equilibrium (NE). Recently, there has
Ruiqi Jin 0002, Shuyi Li, Yongmei Liu 0001   +2 more
openaire   +1 more source

Bonferroni procedures for logically related hypotheses

Journal of Statistical Planning and Inference, 1999
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Hommel, G., Bernhard, G.
openaire   +1 more source

The Logic of SCF Procedures

1975
Since the Schrodinger equation cannot be solved exactly for polyelectronic systems, one has to look for approximate solutions of any desired accuracy. One way is the use of the variation method [1]. The Eckart theorem shows that any trial wavefunction ξ (which is normalizable) leads to a value of the energy e which is never lower than the true ground ...
openaire   +1 more source

Functional Procedures in Higher-Order Logic

2000
In this paper we present an approach for modelling functional procedures (as they occur in imperative programming languages) in a weakest precondition framework. Functional procedures are called inside expressions, but the body of a functional procedure is built using standard specification/programming syntax, including nondeterminism, sequential ...
Linas Laibinis, Joakim von Wright
openaire   +1 more source

A Tutorial on Stålmarck’s Proof Procedure for Propositional Logic

Formal Methods in System Design, 1998
We explain St?lmarck's proof procedure for classical propositional logic. The method is implemented in a commercial tool that has been used successfully in real industrial verification projects. Here, we present the proof system underlying the method, and motivate the various design decisions that have resulted in a system that copes well with the ...
Mary Sheeran, Gunnar Stålmarck
openaire   +1 more source

Temporal aspects of logical procedure definition

Information Systems, 1980
Abstract This paper discusses the inclusion of time in a message-oriented relational model of information systems in order to achieve memory independent specifications. The concept of memory independence is reviewed and several systems languages are analysed from this point of view and also in other aspects of their temporal properties.
openaire   +2 more sources

Modelling defeasibility in law: Logic or procedure?

Fundam. Informaticae, 2001
Summary: This paper investigates whether current nonmonotonic logics are suitable for formalizing the defeasibility of legal reasoning. It does so by studying the role of burden of proof in legal argument, in particular how allocations of burden of proof determine the required strength of counterarguments.
openaire   +3 more sources

Propositional Dynamic Logic for Recursive Procedures

2008
We present a simple and natural deductive formalism μPDL for propositional dynamic logic for recursive procedures, including simultaneous recursion. Though PDL with recursive programs is known to be highly undecidable, natural deductive formalisms for it are of substantial interest, because they distill the essential logical components of recursive ...
openaire   +1 more source