Results 261 to 270 of about 360,829 (301)
Some of the next articles are maybe not open access.
Logical problem determination for SNA networks
IBM Systems Journal, 1983Problem determination on a Systems Network Architecture network has dealt mostly with error detection on physical network components. Adequate logical error-detection mechanisms associated with the logical network (software-related) errors have been only recently provided with the announcement of a new on-line interactive package called the Network ...
Robert A. Weingarten +1 more
openaire +1 more source
A Logical Limitation On Determinism
Philosophy, 1958I begin with some elementary observations about assertion. In spite of recent criticisms of philosophers who have been too ready to take the subject-predicate indicative sentence as the standard form of assertion, there is no doubt that this form of sentence does represent something very fundamental about assertion.
openaire +1 more source
A Temporal Logic Characterisation of Oservational Determinism
19th IEEE Computer Security Foundations Workshop (CSFW'06), 2006This paper studies observational determinism, a generalisation of non-interference for multi-threaded programs. Standard notions of non-interference only consider input and output of programs, but to ensure the security of multithreaded programs, one has to consider execution traces.
Marieke Huisman +2 more
openaire +1 more source
PAC-learnability of determinate logic programs
Proceedings of the fifth annual workshop on Computational learning theory, 1992The field of Inductive Logic Programming (ILP) is concerned with inducing logic programs from examples in the presence of background knowledge. This paper defines the ILP problem, and describes the various syntactic restrictions that are commonly used for learning first-order representations.
Saso Dzeroski +2 more
openaire +2 more sources
On the Determination of Complete Sets of Logical Functions
IEEE Transactions on Computers, 1968Abstract—A procedure is described, based on a theorem of Post, for determining the nonredundant complete sets of logical functions. Kudielka and Oliva's determination of these functions for two and three variables was verified by means of this procedure in less than a minute of computer time.
Stanley R. Petrick, George C. Sethares
openaire +1 more source
Non-determinism in logic-based languages
Annals of Mathematics and Artificial Intelligence, 1991The use of non-determinism in logic-based languages is motivated using pragmatic and theoretical considerations. Non-deterministic database queries and updates occur naturally, and there exist non-deterministic implementations of various languages.
Serge Abiteboul, Victor Vianu
openaire +2 more sources
Intermediate predicate logics determined by ordinals
Journal of Symbolic Logic, 1990AbstractFor each ordinal α > 0, L(α) is the intermediate predicate logic characterized by the class of all Kripke frames with the poset α and with constant domain. This paper will be devoted to a study of logics of the form L(α). It will be shown that for each uncountable ordinal of the form α + η with a finite or a countable η(> 0), there exists
MINARI, PIERLUIGI, M. Takano, H. Ono
openaire +2 more sources
Logical Form as a Determinant of Cognitive Processes
2010We discuss a research program on reasoning patterns in subjects with autism, showing that they fail to engage in certain forms of non-monotonic reasoning that come naturally to neurotypical subjects. The striking reasoning patterns of autists occur both in verbal and in non-verbal tasks.
openaire +4 more sources
Logic Determined by Boolean Algebras with Conjugate
2006We give an axiomatic system of a logic characterized by the class of Boolean algebras with conjugate, which has a close connection with the theory of rough sets, and prove that the logic is decidable.
Michiro Kondo +2 more
openaire +1 more source