A Theoretical Model for Meaning Construction through Constructivist Concept Learning: A Conceptual, Terminological, Logical and Semantic Study within Human …

F Badie - 2017 - vbn.aau.dk
The central focus of this Ph. D. research is on ‘Logic and Cognition’and, more specifically,
this research covers the quintuple (Logic and Logical Philosophy, Philosophy of Education, …

Review of" Alfred Tarski: Life and Logic by Anita Burdman Feferman and Solomon Feferman", Cambridge University Press 2004

P Lescanne - ACM SIGACT News, 2006 - dl.acm.org
The Feferman–Vaught theorem provides a way of evaluating a first order sentence φ on a
disjoint union of structures by producing a decomposition of φ into sentences which can be …

Review of" IT project estimation: a practical guide to costing of software by Paul Coombs." Cambridge University Press 2003

W Tracz - ACM SIGSOFT Software Engineering Notes, 2004 - dl.acm.org
I picked this book up at ICSE 2004 in Edinburgh and read it on the plane back to the states.(You
might guess that I was flying an American carrier.) I had no intention of writing a review

Computational generation of referring expressions: A survey

E Krahmer, K Van Deemter - Computational Linguistics, 2012 - direct.mit.edu
This article offers a survey of computational research on referring expression generation (REG).
It introduces the REG problem and describes early work in this area, discussing what …

Semantic Web: Past, Present, and Future

A Scherp, G Groener, P Škoda, K Hose, ME Vidal - 2024 - drops.dagstuhl.de
Ever since the vision was formulated, the Semantic Web has inspired many generations of
innovations. Semantic technologies have been used to share vast amounts of information on …

[PDF][PDF] A Theoretical Model for Meaning Construction through Constructivist Concept Learning

F Badie - 2017 - researchgate.net
Regarding constructivism as a learning philosophy and/or a model of knowing, a person (learner
or mentor) based on her/his preconceptions and on personal knowings could actively …

[PDF][PDF] A Knowledge Engineering Primer

A Ławrynowicz - arXiv preprint arXiv:2305.17196, 2023 - arxiv.org
… Let us consider the pairwise disjoint sets U, B and L. They denote resources (URI
references), blank nodes, and literals. RDF triple is a tuple t = (s, p, o) ∈ (U ∪ B) × U × (U∪B∪…

[PDF][PDF] D1. 1.1 Overview and analysis of existing benchmark frameworks

G Flouris, N Martinez - Citeseer
Our goal in the LDBC project is to provide a set of open, fair, and vendor-neutral benchmarks
for RDF/graph databases. As a first step towards this goal, this deliverable presents the …

[引言][C] … description logic handbook" by Franz Bader, Diego Calvanese, Deborah L. McGuinness, Daniele Nardi, Peter Patel-Schneider. Cambridge University Press …

J Law - ACM SIGSOFT Software Engineering Notes, 2004