logic

I'm looking for some "inference rules" (similar to set operation rules or logic rules) which I can use to reduce a SQL query in complexity or size. Does there exist something like that? Any papers, any tools? Any equivalencies that you found on your own? It's somehow similar to query optimization, but not in terms of performance. To state it different: Having a (complex) query with JOINs, SUBSELECTs, UNIONs is it possible (or not) to reduce it to a simpler, equivalent SQL statement, which is producing the same result, by using some transformation rules? So, I'm looking for equivalent

How would the condition be written to ensure a page is either accessed by xmlhttp request from my site or from an allowed outside domain? <?php $referrer = $_SERVER['HTTP_REFERER']; if($_SERVER["HTTP_X_REQUESTED_WITH"] !== 'XMLHttpRequest') { if(preg_match("/accepteddomain.com/",$referrer) { header("Location: http://www.domain.com/desiredpage.php"); } else { header("Location: http://www.domain.com/nondesiredpage.php"); } } ?> Considering that both Referer and X-Request-With headers are sent (or not sent) by the client (the browser, or anything else that can send an HTTP request) , they cannot

So here's the code I've got so far... import java.util.Scanner; class count{ public static void main(String args[]){ Scanner s=new Scanner(System.in); System.out.println("Enter a string"); String sent=s.nextLine(); int len = sent.length(); int arr[]=new int[len]; int count=1; char ch[] = new char[len]; for(int i = 0; i <= len-1; i ++) { ch[i] = sent.charAt(i); } for(int j= 0;j<=len-1;j++){ for(int k=0;k<=len-1;k++){ if(ch[j]==ch[k]){ arr[j]= count++; } } } int max=arr[0]; for(int z=1;z<=len-1;z++){ if(count>max) max=count; } System.out.println(max); System.out.println("The character that

I have a program in assembly for the Linux terminal that's supposed to work through a series of mathematical manipulations, compare the final value to 20, and then using if logic, report <, > or = relationship. Code is: segment .data out_less db "Z is less than 20.", 10, 0 out_greater db "Z is greater than 20.", 10, 0 out_equal db "Z is equal to 20.", 10, 0 segment .bss segment .text global main extern printf main: mov eax, 10 mov ebx, 12 mov ecx, eax add ecx, ebx ;set c (ecx reserved) mov eax, 3 mov ebx, ecx sub ebx, eax ;set f (ebx reserved) mov eax, 12 mul ecx add ecx, 10 ;(a+b*c) (ecx

For Modified Baugh-Wooley multiplication algorithm , why is it !(A0*B5) instead of just (A0*B5) ? Same questions for !(A1*B5), !(A2*B5), !(A3*B5), !(A4*B5), !(A5*B4), !(A5*3), !(A5*B2), !(A5*B1) and !(A5*B0) Besides, why there are two extra '1' ? In signed 6-bit 2s complement notation, the place values of the bits are: -32 16 8 4 2 1 Notice that the top bit has a negative value. When addition, subtraction, and multiplication are performed mod 64, however, that minus sign makes absolutely no difference to how those operations work, because 32 = -32 mod 64. Your multiplication is not being

I am creating an application where I need to view blobs in browser rather than downloading them. Currently, links of blobs having token downloads the corresponding blob. I got some reference here to view the blobs in browser : https://github.com/Azure-Samples/storage-blob-java-getting-started/blob/master/src/BlobBasics.java (See from line number 141) Here is my code to create token : @Test public String testBlobSaS(CloudBlob blob, CloudBlobContainer container) throws InvalidKeyException, IllegalArgumentException, StorageException, URISyntaxException, InterruptedException {

What is meant by "logical purity" (in the context of Prolog programming)? The logical-purity tag info says "programs using only Horn clauses" , but then, how would predicates like if_/3 qualify, using as much as it does the cut, and the various meta-logical (what's the proper terminology? var/1 and such) predicates, i.e. the low-level stuff. I get it that it achieves some "pure" effect, but what does this mean, precisely? For a more concrete illustration, please explain how does if_/3 qualify as logically pure, seen in use e.g. in this answer ? Let us first get used to a declarative reading of