Show/Hide Menu
Hide/Show Apps
Logout
Türkçe
Türkçe
Search
Search
Login
Login
OpenMETU
OpenMETU
About
About
Open Science Policy
Open Science Policy
Communities & Collections
Communities & Collections
Help
Help
Frequently Asked Questions
Frequently Asked Questions
Guides
Guides
Thesis submission
Thesis submission
MS without thesis term project submission
MS without thesis term project submission
Publication submission with DOI
Publication submission with DOI
Publication submission
Publication submission
Supporting Information
Supporting Information
General Information
General Information
Copyright, Embargo and License
Copyright, Embargo and License
Contact us
Contact us
A Decision Procedure Model for Findingthe Missing Premise in Automated Reasoning
Date
2017-08-10
Author
Akçelik, Oğuz
Zambak, Aziz Fevzi
Metadata
Show full item record
Item Usage Stats
192
views
0
downloads
Cite This
URI
https://www.math-stockholm.se/polopoly_fs/1.745278!/LC2017book.pdf
https://hdl.handle.net/11511/79509
https://www.academia.edu/35837005/A_Decision_Procedure_Model_for_Finding_the_Missing_Premise_in_Automated_Reasoning_Conference_Presentation_Stockholm_University_
Conference Name
Logic Colloquium 2017, 14 - 20 Ağustos 2017
Collections
Department of Philosophy, Conference / Seminar
Suggestions
OpenMETU
Core
A fuzzy linguistic decision model approach for selecting the optimum promotion mix for digital products with genetic algorithms
Gün, Mustafa Murat; İşler, Veysi; Department of Computer Engineering (2010)
Promotion is one of the four major marketing elements of the marketing mix (others are product, price and place) in implementing marketing strategy. Promotion is dealing with the ways a company communicates with its customers to persuade them to buy the product. Promotion mix covers all the different ways a company choose to communicate with its customers such as advertising, personnel selling, PR, sales promotion and others. Selecting the optimal blend of the promotion mix is a tough and critical issue for...
A heuristic algorithm for hierarchical representation of form documents
Duygulu, P; Atalay, Mehmet Volkan; Dincel, E (1998-08-20)
In this paper our aim is to develop a logical representation for form documents. We propose a hierarchical structure to represent the logical layout of a form by using lines. The approach is top-down and no domain knowledge such as the preprinted data or filled-in data is used. Logically same but physically different forms are associated to the same hierarchical tree. This representation can handle geometrical modifications and slight variations.(1).
A linear programming model for bank balance sheet management
Guven, S; Persentili, E (1997-08-01)
Bank balance-sheet management which involves the determination of the size and composition of a bank's assets and liabilities over a multiperiod planning horizon is one of the most prominent issues in bank strategic planning. Not only management policy choices, but legal restrictions and minimum safety requirements, dictated by the economic and political environment operated in, mean a balance has to be struck between the conflicting objectives of profitability, liquidity and risk. Bank balance-sheet manage...
A Path-Finding Based Method for Concept Discovery in Graphs
Abay, Nazmiye Ceren; Mutlu, Alev; Karagöz, Pınar (2015-07-08)
In the multi-relational data mining, concept discovery is the problem of inducing definitions of a relation in terms of other relations provided. In this paper, we present a method that combines graph-based and association rule mining-based methods for concept discovery in graphs. The proposed method is related to graphs as the data, which is initially stored in a relational database, is represented as a graph and concept descriptors are the paths that connect certain vertices; and it is related to associat...
A Counting-Based Heuristic for ILP-Based Concept Discovery Systems
Mutlu, Alev; Karagöz, Pınar; Kavurucu, Yusuf (2013-09-13)
Concept discovery systems are concerned with learning definitions of a specific relation in terms of other relations provided as background knowledge. Although such systems have a history of more than 20 years and successful applications in various domains, they are still vulnerable to scalability and efficiency issues - mainly due to large search spaces they build. In this study we propose a heuristic to select a target instance that will lead to smaller search space without sacrificing the accuracy. The p...
Citation Formats
IEEE
ACM
APA
CHICAGO
MLA
BibTeX
O. Akçelik and A. F. Zambak, “A Decision Procedure Model for Findingthe Missing Premise in Automated Reasoning,” presented at the Logic Colloquium 2017, 14 - 20 Ağustos 2017, Stockholm, İsveç, 2017, Accessed: 00, 2021. [Online]. Available: https://www.math-stockholm.se/polopoly_fs/1.745278!/LC2017book.pdf.