Results 121 to 130 of about 793,130 (202)

Expressive completeness of existential rule languages for ontology-based query answering

open access: yes, 2016
Existential rules, also known as data dependencies in Databases, have been recently rediscovered as a promising family of languages for Ontology-based Query Answering.
Zhang, Yan (R8899)   +2 more
core  

Modelling Suicide‐Related Communication Dynamics: A Socio‐Cybernetic Framework for Governance

open access: yesSystems Research and Behavioral Science, EarlyView.
ABSTRACT Suicide‐related phenomena (SPS) are often approached through individual‐level risk factors or moral framings, yet their population‐level dynamics depend critically on how ‘suicide’ becomes observable, circulates and is governed across functionally differentiated systems.
Enrique Fernández Vilas, Juan R. Coca
wiley   +1 more source

On Sets Polynomially Enumerable by Iteration

open access: yes, 2012
Sets whose members are enumerated by some Turing machine are called recursively enumerable. We define a set to be polynomially enumerable by iteration if its members are efficiently enumerated by iterated application of some Turing machine.
Young, P.   +3 more
core  

From Map Follower to Navigator: Archetypes of Environmental Impact Assessment

open access: yesSystems Research and Behavioral Science, EarlyView.
ABSTRACT Environmental impact assessment (EIA) scholarship is commonly framed as a tension between efficiency and comprehensiveness paradigms. These paradigms describe a persistent tension but cannot explain how EIA operates through it. Drawing on social systems theory, this analysis traces that operation.
Kenneth Kang
wiley   +1 more source

Turing machines with one-sided advice and acceptance of the co-RE languages

open access: yes, 2017
We resolve an old problem, namely to design a ‘natural’ machine model for accepting the complements of recursively enumerable languages. The model we present is based on non-deterministic Turing machines with ‘one-sided’ advice.
Wiedermann, Jiří   +3 more
core  

The Viable Change Framework: Linking Theory of Change and Organisational Viability for Quality Enhancement in Higher Education

open access: yesSystems Research and Behavioral Science, EarlyView.
ABSTRACT Higher education institutions operate in complex environments that challenge conventional approaches to quality assurance, improvement and enhancement. Drawing on organisational cybernetics and complexity‐aware evaluation, this study develops a viable change framework (VCF) linking a programme's theory of change (ToC) with a viable system ...
Andrea Clark, Sarah Carr, Jeff Foote
wiley   +1 more source

Parsing Based on Regulated Automata

open access: yes, 2016
This work deals with the design, applicability and the implementation of parsing methods based on pushdown automata that regulate the use of their rules by linear control languages.
Genčúrová, Ľubica
core  

When Reform Failure Stabilises Governance Systems: Recursive Regulation and Political Attractor Shifts in Complex Adaptive Governance

open access: yesSystems Research and Behavioral Science, EarlyView.
ABSTRACT This article advances a systems‐theoretical framework for understanding reform dissipation in politically governed complex adaptive systems. Rather than treating failure as deviation from intended design, the framework conceptualises reform dissipation as recursive regulation within threshold‐sensitive attractor landscapes—a reframing with ...
Clas Mellby
wiley   +1 more source

A non-recursively enumerable subset of N which has a short definition in terms of arithmetic

open access: yes
Let F(x,n) denote the formula ∃ab ∀i⩽n ∃swpq ∀jv ∃eg {(s+w)^2+3w+s=2i ∧ ⟨[j=w ∨ v=q] ∨ [j=3i ∧ v=p+q] ∨ [j=s ∧ (v=p ∨ (i=n ∧ v=q+x))] ∨ [j=3i+1 ∧ v=pq] ⇒ a=v+e+ejb ∧ v+g=b⟩} from J. P. Jones' article in vol. 43 of J. Symbolic Logic.
Tyszka, Apoloniusz
core  

Home - About - Disclaimer - Privacy