41 |
Evolution of word meanings through metaphorical mapping: Systematicity over the past millennium. ...
|
|
|
|
BASE
|
|
Show details
|
|
44 |
The Sapir-Whorf hypothesis and inference under uncertainty.
|
|
|
|
In: Wiley interdisciplinary reviews. Cognitive science, vol 8, iss 6 (2017)
|
|
BASE
|
|
Show details
|
|
45 |
Historical Semantic Chaining and Efficient Communication: The Case of Container Names.
|
|
|
|
In: Cognitive science, vol 40, iss 8 (2016)
|
|
BASE
|
|
Show details
|
|
46 |
The Sapir-Whorf Hypothesis and Probabilistic Inference: Evidence from the Domain of Color
|
|
|
|
In: Cibelli, Emily; Xu, Yang; Austerweil, Joseph L; Griffiths, Thomas L; & Regier, Terry. (2016). The Sapir-Whorf Hypothesis and Probabilistic Inference: Evidence from the Domain of Color. PLOS ONE, 11(7), e0158725. doi:10.1371/journal.pone.0158725. UC Berkeley: UC Berkeley Library. Retrieved from: http://www.escholarship.org/uc/item/1pt8b5dj (2016)
|
|
BASE
|
|
Show details
|
|
47 |
The Sapir-Whorf Hypothesis and Probabilistic Inference: Evidence from the Domain of Color.
|
|
|
|
In: PloS one, vol 11, iss 7 (2016)
|
|
BASE
|
|
Show details
|
|
48 |
The Sapir-Whorf Hypothesis and Probabilistic Inference: Evidence from the Domain of Color
|
|
|
|
BASE
|
|
Show details
|
|
52 |
On an algebra of linguistic truth-valued intuitionistic lattice-valued logic
|
|
|
|
BASE
|
|
Show details
|
|
53 |
On {alpha}-satisfiability and its {alpha}-lock resolution in a finite lattice-valued propositional logic
|
|
|
|
Abstract:
Automated reasoning issues are addressed for a finite lattice-valued propositional logic L n P(X) with truth-values in a finite lattice-valued logical algebraic structure—lattice implication algebra. We investigate extended strategies and rules from classical logic to L n P(X) to simplify the procedure in the semantic level for testing the satisfiability of formulas in L n P(X) at a certain truth-value level α (α-satisfiability) while keeping the role of truth constant formula played in L n P(X) . We propose a lock resolution method at a certain truth-value level α (α-lock resolution) in L n P(X) and have proved its theorems of soundness and weak completeness, respectively. We provide more efficient resolution based automated reasoning in L n P(X) and key supports for α-resolution-based automated reasoning approaches and algorithms in lattice based linguistic truth-valued logic.
|
|
Keyword:
Original Articles
|
|
URL: https://doi.org/10.1093/jigpal/jzr007 http://jigpal.oxfordjournals.org/cgi/content/short/20/3/579
|
|
BASE
|
|
Hide details
|
|
56 |
Theories Analyzing Communicative Approach in China’s EFL Classes
|
|
|
|
In: English Language Teaching; Vol 3, No 1 (2010); P159 (2010)
|
|
BASE
|
|
Show details
|
|
|
|