Home Catalogue search

eng

Refine your search:

Search in the Catalogues and Directories






	Sort by
Simple Search

Page: 1 2 3 4 5...23

Hits 1 – 20 of 453

1	Modeling human-like morphological prediction
	Rosen, Eric R
	In: Proceedings of the Society for Computation in Linguistics (2022)
	BASE
	Show details

2	Variables are valuable: making a case for deductive modeling
	Tizón-Couto, David; Lorenz, David
	In: Linguistics. - Berlin [u.a.] : Mouton de Gruyter 59 (2021) 5, 1279-1309
	BLLDB
	Show details

3	Improving Automation for Higher-Order Proof Steps
	Defourné, Antoine
	In: Lecture Notes ; FroCos 2021 - 13th International Symposium on Frontiers of Combining Systems ; https://hal.archives-ouvertes.fr/hal-03528009 ; FroCos 2021 - 13th International Symposium on Frontiers of Combining Systems, Sep 2021, Birmingham, United Kingdom. pp.139-153, ⟨10.1007/978-3-030-86205-3_8⟩ (2021)
	BASE
	Show details

4	Актуальные схемы мошенничества при получении налогового вычета и способы противодействия им ... : Current Schemes of Fraud in Obtaining a Tax Deduction and Ways to Counteract Them ...
	Удалов Максим Игоревич; Шибалова Мария Алексеевна. - : Вестник Саратовской государственной юридической академии, 2021
	BASE
	Show details

5	ПРАВОВАЯ ПОЛИТИКА РОССИЙСКОЙ ФЕДЕРАЦИИ В СФЕРЕ РАЗВИТИЯ ЧАСТНОГО ИНВЕСТИРОВАНИЯ ... : Legal policy of the Russian Federation in the field of private investment development ...
	Е. В. Юдина. - : Правовая политика и правовая жизнь, 2021
	BASE
	Show details

6	Leo-III – A Theorem Prover for Higher-Order Logic ...
	Steen, Alexander; Benzmueller, Christoph. - : Zenodo, 2021
	BASE
	Show details

7	Leo-III 1.6 ...
	Steen, Alexander. - : Zenodo, 2021
	BASE
	Show details

8	Leo-III 1.6 ...
	Steen, Alexander. - : Zenodo, 2021
	BASE
	Show details

9	Discovering Geometric Inequalities: The Concourse of GeoGebra Discovery, Dynamic Coloring and Maple Tools
	Tomás Recio; Rafael Losada; Zoltán Kovács...
	In: Mathematics ; Volume 9 ; Issue 20 (2021)
	BASE
	Show details

10	On Sellars' exam question trilemma: are Kant's premises analytic, or synthetic a priori, or a posteriori?
	O'Shea, James R.. - : Taylor & Francis, 2021
	BASE
	Show details

11	Analysing scientific discourse from a systemic functional linguistic perspective : a framework for exploring knowledge building in biology
	Hao, Jing. - London : Routledge, 2020
	BLLDB
	UB Frankfurt Linguistik
	Show details

12	Proof-theoretic aspects of NLλ
	Moot, Richard
	In: https://hal-lirmm.ccsd.cnrs.fr/lirmm-02973980 ; 2020 (2020)
	BASE
	Show details

13	Leo-III 1.5 – A Theorem Prover for Higher-Order Logic ...
	Steen, Alexander; Benzmueller, Christoph. - : Zenodo, 2020
	BASE
	Show details

14	Backwards Time: The Rhetoric of Reverse
	VIRDEE, DOUGLASS. - 2020
	BASE
	Show details

15	A Semantic Characterization for ASP Base Revision
	Garcia, Laurent; Lefèvre, Claire; Stéphan, Igor...
	In: ISSN: 1076-9757 ; Journal of Artificial Intelligence Research ; https://hal-amu.archives-ouvertes.fr/hal-02392942 ; Journal of Artificial Intelligence Research, Association for the Advancement of Artificial Intelligence, 2019, 66, pp.989 - 1029 (2019)
	BASE
	Show details

16	Epistemic modals, deduction, and factivity: New insights from the epistemic future
	Mihoc, Teodora; Bhadra, Diti; Falaus, Anamaria
	In: Proceedings of the 29th Semantics and Linguistic Theory Conference ; Semantics and Linguistic Theory (SALT) 29 ; https://hal.archives-ouvertes.fr/hal-02428030 ; Semantics and Linguistic Theory (SALT) 29, UCLA, May 2019, Los Angeles, United States. pp.351-370, ⟨10.3765/salt.v28i0.4422⟩ ; https://journals.linguisticsociety.org/proceedings/index.php/SALT/article/view/29.351 (2019)
	BASE
	Show details

17	IN SEARCH OF LOGIC IN TRANSLATION: INDUCTION, DEDUCTION OR ABDUCTION? ...
	Oleksandr, Rebrii. - : Zenodo, 2019
	BASE
	Show details

18	IN SEARCH OF LOGIC IN TRANSLATION: INDUCTION, DEDUCTION OR ABDUCTION? ...
	Oleksandr, Rebrii. - : Zenodo, 2019
	BASE
	Show details

19	Preference inference based on lexicographic and Pareto models
	George, Anne-Marie. - : University College Cork, 2019
	Abstract: Preferences play a crucial part in decision making. When supporting a user in making a decision, it is important to analyse the user’s preference information to compute good recommendations or solutions. However, often it is impractical or impossible to obtain complete knowledge on preferences. Preference inference aims to exploit given preference information and deduce more preferences. More specifically, the Deduction Problem asks whether another preference statement can be deduced from a given set of preference statements. The closely related Consistency Problem asks whether a given set of user preferences is consistent, i.e., the statements are not contradicting each other. We present approaches for preference inference based on qualitative preference models that are based on lexicographic and Pareto orders. We consider user preference statements that are given in the form of comparisons of alternatives or alternative sets. For some model types and preference statements we formulate efficient algorithms; for others we show NP-completeness and coNP-completeness results. In particular, we find that the Deduction and Consistency problem are polynomial time solvable for comparative preference statements for lexicographic and simple Pareto preference models by a detailed analysis of the problem structures. The computational efficiency for these models makes them particularly appealing for practical uses. The Deduction and Consistency Problem are coNP-complete and NP-complete, respectively, for hierarchical and generalised Pareto models, which make these models less practical even for simple preference languages. However, we still formulate a quite efficient algorithmic approach to solve the Consistency Problem (and implicitly the Deduction) for hierarchical models. We also analyse deduction and consistency for preference statements that are (strongly) compositional under some set of preference models. (Strong) compositionality is a property of preference statements in connection with a set of preference models. It demands inference of preference statements for certain combinations of preference models. We find many interesting results for this case, which ultimately leads to a general greedy algorithm to solve the Consistency Problem for strongly compositional preference statements. This indicates that strong compositionality is an important property that can deliver immediate algorithmic approaches when present. We find many types of preference statements, e.g., conjunctions of strongly compositional statements, are strongly compositional. The considered comparative preferences statements are also strongly compositional for many of the discussed preference models - different lexicographic and hierarchical models. We can make use of the Deduction Problem to find a set of optimal alternatives, e.g., to be recommended to a user that are undominated with respect to different notions of optimality. We analyse this connection for general lexicographic models and find computationally efficient solutions.
	Keyword: Algorithms; Complexity; Consistency; Deduction; Lexicographic; Pareto; Preference inference; Preference modelling
	URL: http://hdl.handle.net/10468/7781
	BASE
	Hide details

20	Classical logic, argument and dialectic
	M. D'Agostino; S. Modgil. - : Elsevier, 2018
	BASE
	Show details

Page: 1 2 3 4 5...23

© 2013 - 2024 Lin|gu|is|tik | Imprint | Privacy Policy | Datenschutzeinstellungen ändern