Results 241 to 250 of about 79,255 (279)

Views of People With Psychosis About Algorithm-Based Relapse Prediction and Data Sharing: Qualitative Study.

J Med Internet Res
Eisner E, Ball H, Ainsworth J, Cella M, Drake RJ, Elton D, Faulkner S, Greenwood K, Gumley A, Haddock G, Kendall KM, Kenny A, Krogsæter TI, Lees J, Lewis S, Phiri A, Schwannauer M, Turner R, Walsh AEL, Walters J, Wykes T, Zahid U, Bucci S.   +22 more
europepmc   +1 more source

Some of the next articles are maybe not open access.

Related searches:

Efficient loop-check for KD 45 logic

Lithuanian Mathematical Journal, 2006
We introduce a new sequent calculus for KD 45 logic. A loop-check technique is used to determine whether a sequent derivable or not. We concentrate ourselves on the efficiency of the loop-check technique used. The efficiency is obtained by making the loop-check to act locally (then we need to check only one or two current sequents), instead of a global
exaly   +2 more sources

Loop-Check Specification for a Sequent Calculus of Temporal Logic

Studia Logica, 2022
zbMATH Open Web Interface contents unavailable due to conflicting licenses.
Romas Alonderis, Regimantas Pliuškevičius, Aida Pliuškevičienė, Haroldas Giedra   +3 more
openaire   +2 more sources

Loop checking and the well-founded semantics

1995
Using a calculus of goals, we define the success and failure of a goal for propositional programs in the presence of loop checking. The calculus is sound with respect to the well-founded semantics; for finite programs, it is also complete. A Prolog-style proof search strategy for a modification of this calculus provides a query evaluation algorithm for
Vladimir Lifschitz, Norman McCain, Teodor C. Przymusinski, Robert F. Stärk   +3 more
openaire   +1 more source

An extended variant of atoms loop check for positive logic programs

New Generation Computing, 1997
The Equality check and the Subsumption check are weakly sound, but are not complete even for function-free logic programs. Although the OverSize (OS) check is complete for positive logic programs, it is too general in the sense that it prunes SLD-derivations merely based on the depth-bound of repeated predicate symbols and the size of atoms, regardless
openaire   +1 more source

Efficient loop-check for backward proof search in some non-classical propositional logics

1996
We consider the modal logics KT and S4, the tense logic Kt, and the fragment IPC(∧,→) of intuitionistic logic.
Alain Heuerding, Michael Seyfried, Heinrich Zimmermann   +2 more
openaire   +1 more source