Result 1 to 20 of 170 total
Additively weighted Harary index of some composite graphs. (English)
Discrete Math. 313, No. 1, 26-34 (2013).
1
When disjunction looks like conjunction: pragmatic consequences in ASL. (English)
Aloni, Maria (ed.) et al., Logic, language and meaning. 18th Amsterdam colloquium, Amsterdam, The Netherlands, December 19‒21, 2011. Revised selected papers. Berlin: Springer (ISBN 978-3-642-31481-0/pbk). Lecture Notes in Computer Science 7218, 72-81 (2012).
2
Inquisitive knowledge attribution and the Gettier problem. (English)
Aloni, Maria (ed.) et al., Logic, language and meaning. 18th Amsterdam colloquium, Amsterdam, The Netherlands, December 19‒21, 2011. Revised selected papers. Berlin: Springer (ISBN 978-3-642-31481-0/pbk). Lecture Notes in Computer Science 7218, 52-61 (2012).
3
Delimited control operators prove double-negation shift. (English)
Ann. Pure Appl. Logic 163, No. 11, 1549-1559 (2012).
4
Similarity in soft set theory. (English)
Appl. Math. Lett. 25, No. 3, 310-314 (2012).
5
A test of “reason-based” and “reluctance-to-think” accounts of the disjunction effect. (English)
Inf. Sci. 184, No. 1, 166-175 (2012).
6
A note on admissible rules and the disjunction property in intermediate logics. (English)
Arch. Math. Logic 51, No. 1-2, 1-14 (2012).
7
A quantum-conceptual explanation of violations of expected utility in economics. (English)
Song, Dawei (ed.) et al., Quantum interaction. 5th international symposium, QI 2011, Aberdeen, UK, June 26‒29, 2011. Revised selected papers. Berlin: Springer (ISBN 978-3-642-24970-9/pbk). Lecture Notes in Computer Science 7052, 192-198 (2011).
8
Arithmetic mean based compensatory fuzzy logic. (English)
Int. J. Comput. Intell. Appl. 10, No. 2, 231-243 (2011).
9
Disjunction property and complexity of substructural logics. (English)
Theor. Comput. Sci. 412, No. 31, 3992-4006 (2011).
10
Bayesian and classical approaches for hypotheses testing in trisomies. (English)
Commun. Stat., Simulation Comput. 40, No. 3, 307-321 (2011).
11
A logical characterisation of ordered disjunction. (English)
AI Commun. 24, No. 2, 165-175 (2011).
12
$y$-Wiener index of composite graphs. (English)
Appl. Math. Lett. 24, No. 7, 1099-1104 (2011).
13
Read-once functions with hard-to-test projections. (English)
Mosc. Univ. Comput. Math. Cybern. 34, No. 4, 188-190 (2010); translation from Vestn. Mosk. Univ., Ser. XV 2010, No. 4, 38-41 (2010).
14
Tabling and answer subsumption for reasoning on logic programs with annotated disjunctions. (English)
Hermenegildo, Manuel (ed.) et al., Technical communications of the 26th international conference on logic programming (ICLP 2010), July 16‒19, 2010, Edinburgh, Scotland, UK. Wadern: Schloss Dagstuhl ‒ Leibniz Zentrum für Informatik (ISBN 978-3-939897-17-0). LIPICS ‒ Leibniz International Proceedings in Informatics 7, 162-171, electronic only (2010).
15
The modified Zagreb indices about disjunction and symmetric difference of graphs. (English)
Ars Comb. 96, 521-531 (2010).
16
Free choice from iterated best response. (English)
Aloni, Maria (ed.) et al., Logic, language and meaning. 17th Amsterdam colloquium, Amsterdam, The Netherlands, December 16‒18, 2009. Revised selected papers. Berlin: Springer (ISBN 978-3-642-14286-4/pbk). Lecture Notes in Computer Science 6042. Lecture Notes in Artificial Intelligence, 295-304 (2010).
17
Knowability principle and disjunction property. (English)
Log. Anal., Nouv. Sér. 53, No. 209, 9-23 (2010).
18
The algebraic structure of amounts: Evidence from comparatives. (English)
Icard, Thomas (ed.) et al., Interfaces: explorations in logic, language and computation. ESSLLI 2008 and ESSLLI 2009 student sessions. Selected papers. Berlin: Springer (ISBN 978-3-642-14728-9/pbk). Lecture Notes in Computer Science 6211. Lecture Notes in Artificial Intelligence, 38-56 (2010).
19
Hypersequent calculi for intuitionistic logic with classical atoms. (English)
Ann. Pure Appl. Logic 161, No. 3, 427-446 (2009).
20
Result 1 to 20 of 170 total
Start
Contact
Print
General Help
